lintcode--摊平嵌套的列表

题目：给你一个嵌套的列表，实现一个迭代器将其摊平。一个列表的每个元素可能是整数或者一个列表。

样例

给出列表 [[1,1],2,[1,1]]，经过迭代器之后返回 [1,1,2,1,1]。

给出列表 [1,[4,[6]]]，经过迭代器之后返回 [1,4,6]。

解答：该题属于使用给定的数据类型和方法， 使用queue进行BFS，递归解决问题。

/**
 * // 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) {
        // Initialize your data structure here.
        helpProcess(nestedList, res);
    }
    void helpProcess(const vector<NestedInteger> &nestedList, queue<int> &res) {
        if (nestedList.size() == 0)
            return;
        for (int i = 0; i < nestedList.size(); i++) {
            if (nestedList[i].isInteger()) {
                res.push(nestedList[i].getInteger());
            } else {
                helpProcess(nestedList[i].getList(), res);
            }
        }
    }
    // @return {int} the next element in the iteration
    int next() {
        // Write your code here
        int val = res.front();
        res.pop();
        return val;
    }

    // @return {boolean} true if the iteration has more element or false
    bool hasNext() {
        // Write your code here
        if (res.size() > 0)
            return true;
        else
            return false;
    }
private:
    queue<int> res;
};

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