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

要求：把一个无限嵌套的列表拆开成数组
思路：递归，貌似可以把递归改成内部函数。另一方法是用栈，先倒序放进去，要取下一个才出栈，是列表再入栈

/**
 * // 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:
    vector<int> v;
    int i;
    NestedIterator(vector<NestedInteger> &nestedList) {
        for(auto &n:nestedList){
            if(n.isInteger())v.push_back({n.getInteger()});
            else {
                for(int &k:solve(n.getList()))
                    v.push_back(k);
            }
        }
        i=0;
    }
    vector<int> solve(vector<NestedInteger> n){
        vector<int> ans;
        for(auto &nn:n){
            if(nn.isInteger())ans.push_back({nn.getInteger()});
            else {
                for(int &k:solve(nn.getList()))
                    ans.push_back(k);
            }
        }
        return ans;
    }
    
    int next() {
        return v[i++];
    }
    
    bool hasNext() {
        return i<v.size();
    }
};

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