很好的参考点击打开链接,这个更厉害哦点击打开链接,对其实是两个iterator的利用,对于follow up,之后看
public class ZigzagIterator {
Iterator<Integer> it1 = null;
Iterator<Integer> it2 = null;
int turn = 0;
public ZigzagIterator(List<Integer> v1, List<Integer> v2) {
it1 = v1.iterator();
it2 = v2.iterator();
turn = 0;
}
public int next() {
turn++;
if ((turn%2==1 && it1.hasNext())||(!it2.hasNext())) {
return it1.next();
} else {
//其实是这个条件if ((turn%2==0 && it2.hasNext())||(!it1.hasNext()))
return it2.next();
}
}
public boolean hasNext() {
return it1.hasNext() || it2.hasNext();
}
}
/**
* Your ZigzagIterator object will be instantiated and called as such:
* ZigzagIterator i = new ZigzagIterator(v1, v2);
* while (i.hasNext()) v[f()] = i.next();
*/
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]
.