LintCode 528: Flatten Nested List Iterator (stack和queue经典题)

528. Flatten Nested List Iterator

Given a nested list of integers, implement an iterator to flatten it.

Each element is either an integer, or a list – whose elements may also be integers or other lists.

Example
Example1

Input: list = [[1,1],2,[1,1]]
Output: [1,1,2,1,1]
Example2

Input: list = [1,[4,[6]]]
Output: [1,4,6]
Notice
You don’t need to implement the remove method.

解法1：用queue展开nestedList。
代码如下：

/**
 * // 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) {
        makeQueue(nestedList);
    }

    // @return {int} the next element in the iteration
    int next() {
        int t = q.front();
        q.pop();
        return t;
    }

    // @return {boolean} true if the iteration has more element or false
    bool hasNext() {
        return !q.empty();
    }
private:
    queue<int> q;
    void makeQueue(const vector<NestedInteger> &nestedList) {
        int n = nestedList.size();
        for (int i = 0; i < n; ++i) {
            if (nestedList[i].isInteger()) {
                q.push(nestedList[i].getInteger());
            } else {
                makeQueue(nestedList[i].getList());
            }
        }
    }
};

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

解法2：用stack。
注意：

1. push进stack要倒序。
2. 把主要工作放在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 {
public:
    NestedIterator(vector<NestedInteger> &nestedList) {
        int n = nestedList.size();
        for (int i = n - 1; i >= 0; i--) {
            st.push(nestedList[i]);
        }
    }

    // @return {int} the next element in the iteration
    int next() {
        int topInt = st.top().getInteger();
        st.pop();
        return topInt;
    }

    // @return {boolean} true if the iteration has more element or false
    bool hasNext() {
        while(!st.empty()) {
            NestedInteger nI = st.top();
            if (nI.isInteger()) return true;
            else {
                vector<NestedInteger> nL = nI.getList();
                st.pop();
                int n = nL.size();
                for (int i = n - 1; i >= 0; --i) {
                    st.push(nL[i]);
                }
            }
            
        }
        return false;
    }

private:
    stack<NestedInteger> st;
    
};

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