LeetCode No341. Flatten Nested List Iterator

1. 题目描述

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

2. 思路

  1. 在构造函数中,利用题目提供的API将嵌套列表递归展开到vector<int>对象中,注意使用下标,可以省去列表的复制开销。
  2. 迭代器中使用iter_记录迭代器当前位置。

3. 算法

/**
 * // 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) {
        Flaten(nestedList, 0, ivec_);
        iter_ = ivec_.begin();
    }

    int next() {
        return *iter_++;
    }

    bool hasNext() {
        if (iter_ != ivec_.end())  return true;
        else return false;
    }
private:
    void Flaten(const vector<NestedInteger> &nested_list, int idx, vector<int> &out_vec) {
        if (idx == nested_list.size())  return;
        if (nested_list[idx].isInteger()) {
            out_vec.push_back(nested_list[idx].getInteger());
        } else {
            Flaten(nested_list[idx].getList(), 0, out_vec);
        }
        Flaten(nested_list, idx + 1, out_vec);
    }
    vector<int> ivec_;
    vector<int>::iterator iter_;
};

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

4. 参考资料

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值