NestedList迭代器 Flatten Nested List Iterator

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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].

解决：

① 根据题目和给出的接口定义，我们知道每一个NestedInteger实际上是一棵树，所有的Integer都在树的叶子节点上（树的叶子节点不全是Integer，还包括空List），我们要遍历的nestedList其实就是NestedInteger组成的森林。对nestedList中树的遍历，我们从左向右遍历，对每一颗树，我们采用后根遍历，最后得出的结果就是题目要求的。借助栈实现迭代。

/**
 * // 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> { //10ms
    Stack<NestedInteger> stack = new Stack<>(); 
    public NestedIterator(List<NestedInteger> nestedList) {
        if (nestedList == null) return;
        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.isEmpty()){
            NestedInteger top = stack.peek();
            if (top.isInteger()){
                return true;
            }else{
                stack.pop();
                for (int i = top.getList().size() - 1;i >= 0; i --){
                    stack.push(top.getList().get(i));
                }
            }
        }
        return false;
    }
}
/**
 * Your NestedIterator object will be instantiated and called as such:
 * NestedIterator i = new NestedIterator(nestedList);
 * while (i.hasNext()) v[f()] = i.next();
 */

② 在构造时直接将递归faltten之后的结果保存在list中。

class NestedIterator implements Iterator<Integer> { //6ms
    int index = 0;
    List<Integer> list;
    public NestedIterator(List<NestedInteger> nestedList) {
        list = new ArrayList<>();
        flattern(nestedList);
    }
    public void flattern(List<NestedInteger> nestedList){
        for (NestedInteger nestedInteger : nestedList){
            if (nestedInteger.isInteger()){
                list.add(nestedInteger.getInteger());
            }else {
                flattern(nestedInteger.getList());
            }
        }
    }
    @Override
    public Integer next() {
        return list.get(index ++);
    }
    @Override
    public boolean hasNext() {
        return index < list.size();
    }
}

转载于:https://my.oschina.net/liyurong/blog/1594965