Each element is either an integer, or a list -- whose elements may also be integers or other lists.
You don‘t need to implement the remove method.
Example1
Input: list = [[1,1],2,[1,1]]
Output: [1,1,2,1,1]
Example2
Input: list = [1,[4,[6]]] Output: [1,4,6]
import java.util.Iterator;
public class NestedIterator implements Iterator<Integer> {
private Stack<NestedInteger> stack;
private void pushListToStack(List<NestedInteger> nestedList) {
Stack<NestedInteger> temp = new Stack<>();
for (NestedInteger nested : nestedList) {
temp.push(nested);
}
while (!temp.isEmpty()) {
stack.push(temp.pop());
}
}
public NestedIterator(List<NestedInteger> nestedList) {
stack = new Stack<>();
pushListToStack(nestedList);
}
// @return {int} the next element in the iteration
@Override
public Integer next() {
if (!hasNext()) {
return null;
}
return stack.pop().getInteger();
}
// @return {boolean} true if the iteration has more element or false
@Override
public boolean hasNext() {
while (!stack.isEmpty() && !stack.peek().isInteger()) {
pushListToStack(stack.pop().getList());
}
return !stack.isEmpty();
}
@Override
public void remove() {}
}
原文:https://www.cnblogs.com/FLAGyuri/p/12078476.html