2020-05-24

1.題目描述

扁平化嵌套列表迭代器

2.題解

使用遞歸即可

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) {int l=nestedList.size();for (int i=0;i<l;i++){if (nestedList[i].isInteger()){ // 如果是數(shù)字的話myque.push(nestedList[i].getInteger());}else{fun(nestedList[i].getList());}}}void fun(vector<NestedInteger> list){int l=list.size();for (int i=0;i<l;i++){if (list[i].isInteger()){ // 如果是數(shù)字的話myque.push(list[i].getInteger());}else{fun(list[i].getList());}}}int next() {if (!myque.empty()){int tmp=myque.front();myque.pop();return tmp;}return -1;}bool hasNext() {if (!myque.empty()) return true;return false;}queue<int> myque; };/*** Your NestedIterator object will be instantiated and called as such:* NestedIterator i(nestedList);* while (i.hasNext()) cout << i.next();*/

總結(jié)

以上是生活随笔為你收集整理的341. 扁平化嵌套列表迭代器的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。