Flatten Nested List Iterator

1. 解析 

题目大意，将嵌套数组按照访问顺序表示成一维数组。

2. 分析

要借助栈结构，需要注意的一点是，每次加载元素的时候要从后往前添加，栈是后进先出的，之所以不适合采用队列结构，是因为逐个访问的过程实际上就是递归的过程，所以栈是最合适的。具体详见代码~

/**
 * // 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) {
        for (int i = nestedList.size() - 1; i >= 0; --i)
            s.push(nestedList[i]); //加载第一层元素
    }

    int next() {
        NestedInteger nestedInteger = s.top(); s.pop();
        return nestedInteger.getInteger();
    }

    bool hasNext() {
        while (! s.empty()){
            NestedInteger nestedInteger = s.top();
            if (nestedInteger.isInteger()) return true; //当前元素是数字
            s.pop();
            vector<NestedInteger> nestedList = nestedInteger.getList(); //当前元素是数组
            for (int i = nestedList.size() - 1; i >= 0; --i)
                s.push(nestedList[i]);
        }
        return false;
    }
private:
    stack<NestedInteger> s;
};

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

3. 类似的题目

Mini Parser

 [1]https://www.cnblogs.com/grandyang/p/5358793.html