LeetCode341. 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:

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

Example 2:

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

这道题的关键在于理解输入。

本题的输入是一个嵌套结构，每个元素可能只是一个整数，也可能是一个链表；而链表中也可能再包含链表结构。面对这种输入，递归常常是一个方便的解决方案。

class NestedIterator {
private:
	list<int> l;
	void helper(vector<NestedInteger> input) {
		for (auto it : input) {
			if (it.isInteger()) l.push_back(it.getInteger());
			else helper(it.getList());
		}
	}
public:
	NestedIterator(vector<NestedInteger>& nestedList) {
		helper(nestedList);
	}

	int next() {
		int ans = l.front();
		l.pop_front();	
        return ans;
	}

	bool hasNext() {
		return !l.empty();
	}
};