# Flatten Nested List Iterator 扁平化嵌套列表迭代器

输入: [[1,1],2,[1,1]]

输入: [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;
* };
*/
class NestedIterator {
public:
NestedIterator(vector<NestedInteger> &nestedList) {
ini(nestedList, vec);
}

void ini(vector<NestedInteger> nestedList,stack<int> &vec) {
for (int i = nestedList.size()-1; i >=0 ; i--) {
if (nestedList[i].isInteger()) vec.push(nestedList[i].getInteger());
else {
ini(nestedList[i].getList(),vec);
}
}
}
int next() {
int tmp = vec.top();
vec.pop();
return tmp;
}

bool hasNext() {
if (vec.empty()) return false;
return true;
}
private:
stack<int> vec;
};

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