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

/**
 * // 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:
    stack<NestedInteger*> st;
    NestedIterator(vector<NestedInteger> &nestedList) {
        for(int i=nestedList.size()-1;i>=0;--i)
            st.push(&nestedList[i]);
    }

    int next() {
        int res = st.top()->getInteger();
        st.pop();
        return res;
    }

    bool hasNext() {
        if(st.empty())
            return false;
        NestedInteger* tmp = st.top();
        while(!tmp->isInteger()){
            st.pop();
            vector<NestedInteger> &list = tmp->getList();
            for(int i = list.size()-1;i>=0;--i)
                st.push(&list[i]);
            if(st.empty())
                return false;
            tmp = st.top();
        }
        return true;
    }
};

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