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:

Input: [[1,1],2,[1,1]]
Output: [1,1,2,1,1]
Explanation: By calling next repeatedly until hasNext returns false, 
             the order of elements returned by next should be: [1,1,2,1,1].

Example 2:

Input: [1,[4,[6]]]
Output: [1,4,6]
Explanation: By calling next repeatedly until hasNext returns false, 
             the order of elements returned by next should be: [1,4,6].

本题题意是将嵌套的List展开铺平。思路是使用一个队列保存铺平后的结果,遍历嵌套结构,如果是Integer类型,则直接加入队列无需展开;若是List类型,则再次调用展开函数,将List内容展开。展开函数利用了递归实现。因为题目中给的接口是迭代器的相关函数,所以我们可以通过返回结果对应的iterator相关函数结果。

/**
 * // 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> {
    private LinkedList<Integer> list;
    private Iterator<Integer> iter;
    public NestedIterator(List<NestedInteger> nestedList) {
        list = new LinkedList<Integer> ();
        flatNest(nestedList);
        iter = list.iterator();
    }
    
    private void flatNest(List<NestedInteger> nestedList){
        for(NestedInteger nlist : nestedList){
            if(nlist.isInteger()){
                list.add(nlist.getInteger());
            }
            else flatNest(nlist.getList());
        }
    }

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

    @Override
    public boolean hasNext() {
        return iter.hasNext();
    }
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值