Flatten Nested List Iterator

本文介绍了一种实现嵌套列表迭代器的方法,该迭代器能够遍历包含多个层级整数及列表的复杂数据结构,并确保按顺序返回所有元素。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

 Notice

You don't need to implement the remove method.

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

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

    这里在代码中需要保证stack中的第一个元素一定是integer类型,而非是nestedlist类型,因此要使用while在hasnext的处理时。

    java

    /**
     * // 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();
     * }
     */
    import java.util.Iterator;
    
    public class NestedIterator implements Iterator<Integer> {
    
        Stack<NestedInteger> stack;
        public NestedIterator(List<NestedInteger> nestedList) {
            // Initialize your data structure here.
            stack = new Stack<NestedInteger>();
            reverse(nestedList);
        }
    
        // @return {int} the next element in the iteration
        @Override
        public Integer next() {
            // Write your code here
            return stack.pop().getInteger();
        }
    
        // @return {boolean} true if the iteration has more element or false
        @Override
        public boolean hasNext() {
            // Write your code here
            while (!stack.isEmpty() && !stack.peek().isInteger()) {
                reverse(stack.pop().getList());
            }
            return stack.isEmpty();
        }
    
        @Override
        public void remove() {}
        
        private void reverse(List<NestedInteger> list) {
            Stack<NestedInteger> temp = new Stack<>();
            for (NestedInteger val : list) {
                temp.push(val);
            }
            while (!temp.isEmpty()) {
                stack.push(temp.pop());
            }
        }
    }
    
    /**
     * Your NestedIterator object will be instantiated and called as such:
     * NestedIterator i = new NestedIterator(nestedList);
     * while (i.hasNext()) v.add(i.next());
     */


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

ncst

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值