Simple C++ using a single queue


  • 0
    U
    /**
     * // 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:
        queue<int>Q;
        NestedIterator(vector<NestedInteger> &nestedList) {
            buildQ(nestedList);
        }
    
        void buildQ(vector<NestedInteger> &curr)
        {
            for(int i=0; i<curr.size(); i++)
            {
                if(curr[i].isInteger())Q.push(curr[i].getInteger());
                else buildQ(curr[i].getList());
            }
        }
        
        int next() {
            int ret = Q.front();
            Q.pop();
            return ret;
        }
    
        bool hasNext() {
            return !Q.empty();
        }
    };
    
    /**
     * Your NestedIterator object will be instantiated and called as such:
     * NestedIterator i(nestedList);
     * while (i.hasNext()) cout << i.next();
     */

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.