LeetCode #281. Zigzag Iterator

最新推荐文章于 2025-02-03 15:37:10 发布

LawFile

最新推荐文章于 2025-02-03 15:37:10 发布

阅读量232

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/103304389

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

题目描述：

Given two 1d vectors, implement an iterator to return their elements alternately.

Example:

Input: v1 = [1,2] v2 = [3,4,5,6] 
Output: [1,3,2,4,5,6]
Explanation:
 By calling next repeatedly until hasNext returns false, the order of elements returned by next should be:
[1,3,2,4,5,6].

Follow up:

What if you are given k 1d vectors? How well can your code be extended to such cases?

Clarification for the follow up question:
The "Zigzag" order is not clearly defined and is ambiguous for k > 2 cases. If "Zigzag" does not look right to you, replace "Zigzag" with "Cyclic". For example:

Input:
[1,2,3]
[4,5,6,7]
[8,9]

Output: [1,4,8,2,5,9,3,6,7].

class ZigzagIterator {
public:
    ZigzagIterator(vector<int>& v1, vector<int>& v2) {
        a=v1, b=v2;
        i=0, j=0;
        first=true;
    }

    int next() {
        if(first)
        {
            first=false;
            if(i==a.size()) return next();
            else
            {
                int x=a[i];
                i++;
                return x;
            }
        }
        else
        {
            first=true;
            if(j==b.size()) return next();
            else
            {
                int x=b[j];
                j++;
                return x;
            }
        }
    }

    bool hasNext() {
        return i<a.size()||j<b.size();
    }
    
private:
    vector<int> a, b;
    int i, j;
    bool first;
};