341. Flatten Nested List Iterator

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 hasNext returns 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]

题目不难，关键在于理解。

这个题目的所有元素均是一个对象，对象里面又可能有一个该对象的列表，所以一开始理解起来很别扭。遍历的时候可以用递归实现，程序如下所示：

/**
 * // 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> {
    
    private List<Integer> list = null;
    private int currentIndex = 0;

    public NestedIterator(List<NestedInteger> nestedList) {
        list = new ArrayList<>();
        int len = nestedList.size();
        for (int i = 0; i < len; ++ i){
            recursion(nestedList.get(i));
        }
    }
    
    public void recursion(NestedInteger nestedInteger){
        if (nestedInteger == null){
            return;
        }
        if (nestedInteger.isInteger()){
            list.add(nestedInteger.getInteger());
            return;
        }
        else {
            for (int i = 0; i < nestedInteger.getList().size(); ++ i){
                recursion(nestedInteger.getList().get(i));
            }
        }
    }

    @Override
    public Integer next() {
        if (currentIndex < list.size()){
            return list.get(currentIndex++);
        }
        return null;
    }

    @Override
    public boolean hasNext() {
        return currentIndex < list.size();
    }
}

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