Leecode刷题笔记——341. 扁平化嵌套列表迭代器

思路如下：
1、要求按照从前到后的顺序进行遍历，因此可以考虑使用LinkedList存储。
2、由于可能存在多维的Node，因此可以考虑采用递归

/**
 * // 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> {
    //LinkedList存储
    LinkedList<Integer> list=new LinkedList<>();
    public NestedIterator(List<NestedInteger> nestedList) {
        //遍历list，采用递归
        for(NestedInteger ni:nestedList){
            DFS(ni);
        }
    }

    @Override
    public Integer next() {
        return list.poll();
    }

    @Override
    public boolean hasNext() {
        if(list.isEmpty()){
            return false;
        }
        return true;
    }

    public void DFS(NestedInteger ni){
        //递归调用终止条件
        if(ni.isInteger()){
        	//需要注意是用add方法,add方法表示添加到表的末尾，不能用push，它是添加到队头
            list.add(ni.getInteger());
        }
        //递归调用
        for(NestedInteger temp:ni.getList()){
            DFS(temp);
        }
    }
}

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

原题地址：
341. 扁平化嵌套列表迭代器