[LeetCode 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:

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

Example 2:

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

分析

嵌套的数组的遍历，一个比较直观的做法就是把嵌套的数组转化为一维的正常的数组，这样就能很简单的遍历。

嵌套数组转化为一维数组使用递归的办法进行转换。

Code 

/**
 * // 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) {
        index = 0;
        flatten(nestedList);
        length = array.size();
    }

    int next() {
        return array[index++];
    }

    bool hasNext() {
        return index < length ? true : false;
    }
    
    void flatten(vector<NestedInteger>& nestedList)
    {
        for (int i = 0; i <nestedList.size(); i ++)
        {
            if (nestedList[i].isInteger())
                array.push_back(nestedList[i].getInteger());
            else
            {
                flatten(nestedList[i].getList());
            }
        }
        return;
    }
    
    int length;
    int index;
    vector<int> array;
};

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

运行效率

Runtime: 20 ms, faster than 100.00% of C++ online submissions for Flatten Nested List Iterator.

Memory Usage: 16.3 MB, less than 57.31% of C++ online submissions forFlatten Nested List Iterator.