341. Flatten Nested List Iterator (Medium)

Given a nested list of integers, implement an iterator to flatten it.

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

Example 1:
Given the list[[1,1],2,[1,1]],

By calling next repeatedly until has Nextreturns false, the order of elements returned by next should be:[1,1,2,1,1].

Example 2:
Given the list[1,[4,[6]]],

By calling next repeatedly until hasNext returns false, the order of elements returned by next should be:[1,4,6].

Solution 1: Stack O(n)

In the constructor, we push all the nestedList into the stack from back to front, so when we pop the stack, it returns the very first element.
Second, in the hasNext() function, we peek the first element in stack currently, and if it is an Integer, we will return true and pop the element. If it is a list, we will further flatten it. This is iterative version of flatting the nested list. Again, we need to iterate from the back to front of the list.

这题如果想用Queue或者ArrayList，那就必须用递归。因为如果用链表，遇到一个list，需要将其转为连续的数，如果添加在链表后面，就不能满足题目要求。

/**
 * // 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> {
    Stack<NestedInteger> stack = new Stack<>();

    public NestedIterator(List<NestedInteger> nestedList) {
        for (int i = nestedList.size() - 1; i >= 0; i--) {
            stack.push(nestedList.get(i));
        }
    }

    @Override
    public Integer next() {
        return stack.pop().getInteger();
    }

    @Override
    public boolean hasNext() {
        while (!stack.empty()) {
            NestedInteger cur = stack.peek();
            if (cur.isInteger()) {
                return true;
            }

            stack.pop(); //pop list and then flatten list
            for (int i = cur.getList().size() - 1; i >= 0; i--) {
                stack.push(cur.getList().get(i));
            }
        }
        return false;
    }
}