Flatten Nested List Iterator

本文介绍了一种用于处理嵌套整数列表的数据结构——嵌套迭代器,并分别用C++与Python实现。该迭代器可以平滑地遍历包含多个层级的整数列表,提供next和hasNext等方法,简化了复杂嵌套数据结构的处理过程。

c++

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * class NestedInteger {
 *   public:
 *     // Return true if this NestedInteger holds a single integer, rather than a nested list.
 *     bool isInteger() const;
 *
 *     // Return the single integer that this NestedInteger holds, if it holds a single integer
 *     // The result is undefined if this NestedInteger holds a nested list
 *     int getInteger() const;
 *
 *     // Return the nested list that this NestedInteger holds, if it holds a nested list
 *     // The result is undefined if this NestedInteger holds a single integer
 *     const vector<NestedInteger> &getList() const;
 * };
 */
class NestedIterator {
public:
    NestedIterator(vector<NestedInteger> &nestedList) {
        iterator(nestedList);
    }

    int next() {
        int res = cache.front();
        cache.pop();
        return res;
    }

    bool hasNext() {
        return !cache.empty();
    }
private:
    queue<int> cache;

    void iterator(const vector<NestedInteger> &List) {
        for (auto &v : List) {
            if (v.isInteger())
                cache.push(v.getInteger());
            else {
                iterator(v.getList());
            }
        }
    }
};

/**
 * Your NestedIterator object will be instantiated and called as such:
 * NestedIterator i(nestedList);
 * while (i.hasNext()) cout << i.next();
 */

python

class NestedIterator(object):

    def __init__(self, nestedList):
        """
        Initialize your data structure here.
        :type nestedList: List[NestedInteger]
        """
        self.cache = collections.deque() 
        self.iterator(nestedList)
    def next(self):
        """
        :rtype: int
        """
        return self.cache.popleft()

    def hasNext(self):
        """
        :rtype: bool
        """
        return True if len(self.cache)>0 else False

    def iterator(self, nestlist):
        for v in nestlist:
            if v.isInteger():
                self.cache.append(v.getInteger())
            else:
                self.iterator(v.getList())
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值