341. Flatten Nested List Iterator

341. 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 1:
Given the list [[1,1],2,[1,1]],

By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,1,2,1,1].

Example 2:
Given the list [1,[4,[6]]],

By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,4,6].

转载于 点击打开链接

/**
 * // 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;
 * };
 */

这里定义了一系列NestedInteger类的接口：

isInteger(): 返回是否是一个数还是一个链表

getInteger():返回单个数

getList():是表的话，返回表

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

这个对象的调用如下：如果它有下一个数的话，不断返回下一个数。希望能在O(1)的时间内完成操作。想到的是栈。将所有元素由低到高的存入栈中，在hasNext()中对其处理，如果遇到一个list，就迭代的将表里的元素加入栈中，直至遇到一个数，此时返回1.

class NestedIterator {
    stack<NestedInteger> stk;
public:
    NestedIterator(vector<NestedInteger> &nestedList) {
        int n=nestedList.size();
        for(int i=n-1;i>=0;i--)
        stk.push(nestedList[i]);
    }

    int next() {
       int val= stk.top().getInteger();//输出这个数
       stk.pop();
       return val;
    }

    bool hasNext() {
       while(!stk.empty())
       {
           NestedInteger cur=stk.top();
           if(cur.isInteger()) return true;//直至遇到一个整数，返回1
           stk.pop();
           int n=cur.getList().size();
           for(int i=n-1;i>=0;i--)
           stk.push(cur.getList()[i]);
       }
       return false;
    }
};