341. Flatten Nested List Iterator
Queue + DFS
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* public interface NestedInteger {
*
* // @return true if this NestedInteger holds a single integer, rather than a nested list.
* public boolean isInteger();
*
* // @return the single integer that this NestedInteger holds, if it holds a single integer
* // Return null if this NestedInteger holds a nested list
* public Integer getInteger();
*
* // @return the nested list that this NestedInteger holds, if it holds a nested list
* // Return null if this NestedInteger holds a single integer
* public List<NestedInteger> getList();
* }
*/
public class NestedIterator implements Iterator<Integer> {
Deque<Integer> queue;
public NestedIterator(List<NestedInteger> nestedList) {
queue = new ArrayDeque<>();
helper(nestedList, queue);
}
private void helper(List<NestedInteger> nestedList, Deque<Integer> queue) {
for (NestedInteger nestedInteger : nestedList) {
if (nestedInteger.isInteger()) {
queue.offerLast(nestedInteger.getInteger());
} else {
helper(nestedInteger.getList(), queue);
}
}
}
@Override
public Integer next() {
return queue.pollFirst();
}
@Override
public boolean hasNext() {
return !queue.isEmpty();
}
}
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i = new NestedIterator(nestedList);
* while (i.hasNext()) v[f()] = i.next();
*/