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

问题分析

• 给定一个序列，设计迭代器中的 next() 以及 hasNext() 函数
• 利用栈的LIFO特性

代码实现

• 注意，LeetCode 评论区中也有人说这样做不得分。因为在 hasNext()中便改变了栈的状态，这样是不现实的。

/**
 * // 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> {
    public 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 hasNext() ? stack.pop().getInteger() : null;
    }

    @Override
    public boolean hasNext() {
        //递归实现
        if (stack.isEmpty()) {
            return false;
        }
        NestedInteger cur = stack.peek();
        if (cur.isInteger()) {
            return true;
        }else {
            cur = stack.pop();
            List<NestedInteger> curList = cur.getList();
            for (int i = curList.size() - 1; i >= 0; i--) {
                stack.push(curList.get(i));
            }
            return hasNext();
        }
        /*迭代实现
        while (!stack.isEmpty()) {
            NestedInteger cur = stack.peek();
            if (cur.isInteger()) {
                return true;
            }else {
                cur = stack.pop();
                List<NestedInteger> curList = cur.getList();
                for (int i = curList.size() - 1; i >= 0; i--) {
                    stack.push(curList.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();
 */