[leetcode] 281. Zigzag Iterator 解题报告

题目链接:https://leetcode.com/problems/zigzag-iterator/

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

For example, given two 1d vectors:

v1 = [1, 2]
v2 = [3, 4, 5, 6]

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 - Update (2015-09-18):
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, given the following input:

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

It should return  [1,4,8,2,5,9,3,6,7] .

思路: 既然说了是迭代器, 那么我觉得是不可以申请额外的数组来保存数组值的, 可以用一个队列来保存给定的数组的迭代器的位置, 这样极其干净.

代码如下:

class ZigzagIterator {
public:
    ZigzagIterator(vector<int>& v1, vector<int>& v2){
        if(v1.size() != 0) que.push(make_pair(v1.begin(), v1.end()));
        if(v2.size() != 0) que.push(make_pair(v2.begin(), v2.end()));
    }

    int next() {
        int val = *que.front().first;
        auto it1 = que.front().first, it2 = que.front().second;
        if(it1+1 != it2) que.push(make_pair(it1+1, it2));
        que.pop();
        return val;
    }

    bool hasNext() {
        return !que.empty();
    }
private:
    queue<pair<vector<int>::iterator, vector<int>::iterator>> que;
};

/**
 * Your ZigzagIterator object will be instantiated and called as such:
 * ZigzagIterator i(v1, v2);
 * while (i.hasNext()) cout << i.next();
 */

参考:https://leetcode.com/discuss/58683/c-with-queue-compatible-with-k-vectors