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

假设有一个嵌套形式的数组，要求按照顺序遍历数组中的元素。

思路和代码

首先可以想到通过深度优先递归的方式将嵌套形式的数组展开为一个无嵌套的列表。那么有没有方法实现不将元素取出而是直接迭代的方式获取下一个元素呢？这里采用了嵌套迭代器的方式进行遍历

    public class FlattenNestedListIterator_341 implements Iterator<Integer>{

        private List<NestedInteger> nestedList;
        private Iterator<Integer> iterator;
        private int next;
        private int index;
        public FlattenNestedListIterator_341(List<NestedInteger> nestedList){
            this.nestedList = nestedList;
        }
        
         @Override
        public Integer next() {
             return next;
        }

        @Override
        public boolean hasNext() {
            if(iterator != null && iterator.hasNext()){
                this.next = iterator.next();
                return true;
            }
            
            if(index>=nestedList.size()){
                return false;
            }
            
            NestedInteger n = nestedList.get(index++);
            if(n.isInteger()){
                next = n.getInteger();
            }else{
                iterator = new FlattenNestedListIterator_341(n.getList());
                if(iterator.hasNext()){
                    next = iterator.next();
                }else{
                    return hasNext();
                }
            }
            return true;
        }
}

想要了解更多开发技术，面试教程以及互联网公司内推，欢迎关注我的微信公众号！将会不定期的发放福利哦~s