平面列表

Posted 2020-10-13

遍历列表中元素，如果是整数则添加到数组中，如果是列表则递归遍历该列表。

/**

* // 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 Solution {
public:
　　// @param nestedList a list of NestedInteger
　　// @return a list of integer
　　vector<int> v;
　　vector<int> flatten(const vector<NestedInteger> &nestedList) {
　　　　// Write your code here
　　int i;
　　int n=nestedList.size();
　　for(i=0;i<n;i++) {
　　if(nestedList[i].isInteger())
　　　　v.push_back(nestedList[i].getInteger());
　　else
　　　　flatten(nestedList[i].getList());
　　}
　　return v;
　　}
};