341. Flatten Nested List Iterator 题解

341. 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.

Example 1:
Given the list [[1,1],2,[1,1]],

By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,1,2,1,1].

Example 2:
Given the list [1,[4,[6]]],

By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,4,6].

题目链接：341. Flatten Nested List Iterator

算法描述：

             由题意知，题目给定我们 " a nested list of integers"，我们需要建立一个 "Flatten Nested List Iterator（迭代器）"。

         首先我们建立一个返回容器 ans，我们遍历题目给出容器中的每一个元素并调用函数"flatten ()"，由题目已给出的信息知，我们可以调用 "isInteger ()" 判断是否为单一整数，如果是，放入容器中，否则，使用 "getList ()" 遍历里面的每一个元素，并调用 "flatten()"。

         在执行完 "flatten()" 函数之后，完成"next ()" 函数："return ans [ ite++ ]; "

         完成"hasNext ()"函数："return ite < ans.size (); "（当 ite 位置指针小于返回容器的大小时返回布尔变量 True， 否则，返回 False）。

代码：

/**
 * // 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 {
    vector<int> ans;
    int ite;
    
    void flatten(NestedInteger list){
        if(list.isInteger()){
            ans.push_back(list.getInteger());
            return;
        }
    
        const vector<NestedInteger> temp=list.getList();
        for(int i=0; i<temp.size(); i++){
            flatten(temp[i]);
        }
    }
    
public:
    NestedIterator(vector<NestedInteger> &nestedList) {
        for(int i=0; i<nestedList.size(); i++)
        flatten(nestedList[i]);
        ite=0;
    }

    int next() {
        return ans[ite++];
    }

    bool hasNext() {
        return ite<ans.size();
    }
};


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