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

leetcode-341. 扁平化嵌套列表迭代器(扒皮)

思路：构造时一层层扒皮，逆向存入栈中，在hasNext时才做深入扒皮搜索。

/**
 * // 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 {
private:
    stack<NestedInteger> st;
public:
    NestedIterator(vector<NestedInteger> &nestedList) {
        for(auto iter=nestedList.rbegin();iter!=nestedList.rend();iter++)
            st.push(*iter);
    }
    
    int next() {
        auto val=st.top();
        st.pop();
        return val.getInteger();
    }
    
    bool hasNext() {
        while(!st.empty()){
            auto cur=st.top();
            if(cur.isInteger()) return true;
            st.pop();
            auto curlist=cur.getList();
            for(auto iter=curlist.rbegin();iter<curlist.rend();iter++)
                st.push(*iter);
        }
        return false;
    }
};

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