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] .

思路：迭代器的关键在于如何保持当前状态，如何从上一状态恢复。

public class ZigzagIterator {
    private List<List<Integer>> vectors = new ArrayList<>();
    private int row, col;
    private int max;
    public ZigzagIterator(List<Integer> v1, List<Integer> v2) {
        vectors.add(v1);
        vectors.add(v2);
        max = Math.max(v1.size(), v2.size());
    }

    public int next() {
        hasNext();
        return vectors.get(row++).get(col);
    }

    public boolean hasNext() {
        while (col<max) {
            while (row<vectors.size()) {
                if (col<vectors.get(row).size()) return true;
                row ++;
            }
            row = 0;
            col ++;
        }
        return false;
    }
}

/**
 * Your ZigzagIterator object will be instantiated and called as such:
 * ZigzagIterator i = new ZigzagIterator(v1, v2);
 * while (i.hasNext()) v[f()] = i.next();
 */