-
Notifications
You must be signed in to change notification settings - Fork 19
Expand file tree
/
Copy pathNestedIterator.java
More file actions
112 lines (99 loc) · 3.84 KB
/
NestedIterator.java
File metadata and controls
112 lines (99 loc) · 3.84 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
package by.andd3dfx.iterators;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
/**
* <pre>
* <a href="https://leetcode.com/problems/flatten-nested-list-iterator/description/">Task description</a>
*
* You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers
* or other lists. Implement an iterator to flatten it.
*
* Implement the NestedIterator class:
* NestedIterator(List<NestedInteger> nestedList) Initializes the iterator with the nested list nestedList.
* int next() Returns the next integer in the nested list.
* boolean hasNext() Returns true if there are still some integers in the nested list and false otherwise.
*
* Your code will be tested with the following pseudocode:
*
* initialize iterator with nestedList
* res = []
* while iterator.hasNext()
* append iterator.next() to the end of res
* return res
*
* If res matches the expected flattened list, then your code will be judged as correct.
*
* Example 1:
* Input: nestedList = [[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: nestedList = [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].
* </pre>
*
* @see <a href="https://youtu.be/RiJ7Rc98vkI">Video solution</a>
*/
public class NestedIterator implements Iterator<Integer> {
private final Deque<Iterator<INestedInteger>> stack = new ArrayDeque<>();
private Integer nextElement;
public NestedIterator(List<INestedInteger> nestedList) {
stack.push(nestedList.iterator());
}
@Override
public Integer next() {
var result = determineNextElement();
if (result == null) {
throw new NoSuchElementException();
}
return result;
}
@Override
public boolean hasNext() {
if (nextElement != null) {
return true;
}
nextElement = determineNextElement();
return nextElement != null;
}
private Integer determineNextElement() {
if (nextElement != null) {
var result = nextElement;
nextElement = null;
return result;
}
while (!stack.isEmpty()) {
Iterator<INestedInteger> iterator = stack.peek();
if (iterator.hasNext()) {
INestedInteger next = iterator.next();
if (next.isInteger()) { // is integer
return next.getInteger();
} else { // is list
stack.push(next.getList().iterator());
return determineNextElement();
}
} else {
stack.pop();
}
}
return null;
}
/**
* This is the interface that allows for creating nested lists. You should not implement it, or speculate about its implementation
*/
public interface INestedInteger {
// @return true if this NestedInteger holds a single integer, rather than a nested list.
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
Integer getInteger();
// @return the nested list that this NestedInteger holds, if it holds a nested list
// Return empty list if this NestedInteger holds a single integer
List<INestedInteger> getList();
}
}