【算法练习】递归/扁平化嵌套列表

前言

今天是@LetItbeSun 坚持每日两题的第25天。

 

题目

341. 扁平化嵌套列表迭代器

 

思路

这个题目对于我来说困惑的点是，为什么自定义类型也可以直接用迭代器

vector<NestedInteger> nestedList;
//遍历这个自定义类型的list 方法一
for (vector<NestedInteger>::iterator it=nestedList.begin();it!=nestedList.end();it++){
  //
}
//方法二
  for(auto &nest:nestedList){
           //
  }

 

其实这题的关键思路，也就是扁平化的要点就是，遇到不是整数的NestedInteger就dfs进行迭代，

对NestedInteger list的每个元素都进行处理 ，是整数则直接加入queue

不是整数就递归调用 最后就得到了扁平化的列表

/**
 * // 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:
    queue<int> q;
    NestedIterator(vector<NestedInteger> &nestedList) {
        //构造函数
        addtoList(nestedList);
    }

    void addtoList(const vector<NestedInteger> &nestedList){
        //递归添加进队列
        for(auto &nest:nestedList){
            if(nest.isInteger()){
                q.push(nest.getInteger());
            }else{
                addtoList(nest.getList());
            }
        }
    }

    int next() {
        int t=q.front();
        q.pop();
        return t;
    }

    bool hasNext() {
        return !q.empty();
    }
};

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