Question
Formatted question description: https://leetcode.ca/all/341.html
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:
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].
@tag-stack
Algorithm
DFS and iteration.
Iteration generally requires the use of the stack to assist traversal, due to the last-in first-out characteristic of the stack.
When we traverse the vector, push the object onto the stack from back to front, then the first object will be the first one to be taken out for processing after being pushed onto the stack.
The hasNext() function needs to traverse the stack and process it,
- If the top element of the stack is an integer, return true directly,
- If not, then remove the top element of the stack, and start traversing the retrieved list, or push it back to the stack
The loop stop condition is that the stack is empty and false is returned.
Code
Java
public class Flatten_Nested_List_Iterator {
public class NestedIterator_stack implements Iterator<Integer> {
private Stack<ListIterator<NestedInteger>> stack;
public NestedIterator_stack(List<NestedInteger> nestedList) {
stack = new Stack<>();
stack.push(nestedList.listIterator());
}
public Integer next() {
hasNext();
return stack.peek().next().getInteger();
}
public boolean hasNext() {
while (!stack.empty()) {
if (!stack.peek().hasNext()) {
stack.pop();
} else {
NestedInteger x = stack.peek().next();
if (x.isInteger())
return stack.peek().previous() == x;
stack.push(x.getList().listIterator());
}
}
return false;
}
}
public class NestedIterator implements Iterator<Integer> {
final Queue<Integer> queue = new LinkedList<Integer>();
public NestedIterator(List<NestedInteger> nestedList) {
if (nestedList == null || nestedList.size() == 0) {
return;
}
dfs(nestedList);
}
private void dfs(List<NestedInteger> list) {
for (NestedInteger nestedInteger : list) {
if (nestedInteger.isInteger()) {
queue.offer(nestedInteger.getInteger());
} else {
dfs(nestedInteger.getList());
}
}
}
@Override
public Integer next() {
if (!queue.isEmpty()) {
return queue.poll();
}
return null;
}
@Override
public boolean hasNext() {
return !queue.isEmpty();
}
}
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i = new NestedIterator(nestedList);
* while (i.hasNext()) v[f()] = i.next();
*/
// This is the interface that allows for creating nested lists.
// You should not implement it, or speculate about its implementation
public interface NestedInteger {
// @return true if this NestedInteger holds a single integer, rather than a nested list.
public boolean isInteger();
// @return the single integer that this NestedInteger holds, if it holds a single integer
// Return null if this NestedInteger holds a nested list
public Integer getInteger();
// @return the nested list that this NestedInteger holds, if it holds a nested list
// Return null if this NestedInteger holds a single integer
public List<NestedInteger> getList();
}
}