leetcode341 - 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.
这道题要求将所给vector打平，相对简单。个人做法是先存入到vector，然后直接访问就行了。

/**
 * // 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 {
private:
    vector<int>integer;
    //vector<NestedInteger> nestedList1;
    int count;
public:    
    NestedIterator(vector<NestedInteger> &nestedList) {
        count = 0;
        //nestedList1 = nestedList;
        setInteger(nestedList);
    }
    
    void setInteger(vector<NestedInteger> &nestedList1){
        for(auto i:nestedList1){
            if(i.isInteger())
                integer.push_back(i.getInteger());
            else
                setInteger(i.getList());
        }
    } 
    
    int next() {
        count++;
        return integer[count - 1];
    }
    
    bool hasNext() {
        if(count < integer.size())return true;
        else return false;
    }
};

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