/**
* // 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:
stack<int> s;
NestedIterator(vector<NestedInteger> &nestedList)
{
for(int i = nestedList.size() - 1; i >= 0;i--)
{
if(nestedList[i].isInteger())
s.push(nestedList[i].getInteger());
else
temp(nestedList[i].getList());
}
}
int next()
{
if(hasNext())
{
int m = s.top();
s.pop();
return m;
}
return 0;
}
bool hasNext()
{
if(s.empty())
return false;
else
return true;
}
void temp(vector<NestedInteger> &nestedList)
{
for(int i = nestedList.size() - 1; i >= 0;i--)
{
if(nestedList[i].isInteger())
s.push(nestedList[i].getInteger());
else
temp(nestedList[i].getList());
}
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/
ps:
一开始用顺序遍历vector存储做的,然后时间上92ms,然后更改为倒序压入栈stack,时间上16ms。