Flatten Nested List Iterator

1，题目要求

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].
给定一个嵌套的整数列表，实现一个迭代器来展平它。

每个元素都是整数或列表 - 其元素也可以是整数或其他列表。

2，题目思路

对于这道题，要求将一个多重嵌套的数组给展开成一个数组。

其中，题目给定的三个内置的方法：
1，isInteger()，判断对象是不是数字。
2，getInteger()，如果对象是数字就返回数字，就获得该数字，如果不是数字，什么都不返回。
3，getList()，如果对象是包含对象的列表，就返回这个列表，否则就什么不返回。

具体实现上，我们用一个队列，来递归地将每个数字都取出来。

3，代码实现

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

    int next() {
        int t = q.front();
        q.pop();
        return t;
    }

    bool hasNext() {
        return !q.empty();
    }
private:
    queue<int> q;
    void makeQueue(vector<NestedInteger> &nestedList){
        for(auto a : nestedList){
            if(a.isInteger())
                q.push(a.getInteger());
            else
                makeQueue(a.getList());
        }
    }
};

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