-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path341-FlattenNestedListIterator.go
More file actions
98 lines (84 loc) · 3.38 KB
/
341-FlattenNestedListIterator.go
File metadata and controls
98 lines (84 loc) · 3.38 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
package main
// 341. Flatten Nested List Iterator
// 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].
// Constraints:
// 1 <= nestedList.length <= 500
// The values of the integers in the nested list is in the range [-10^6, 10^6].
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* type NestedInteger struct {
* }
*
* // Return true if this NestedInteger holds a single integer, rather than a nested list.
* func (this NestedInteger) IsInteger() bool {}
*
* // 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
* // So before calling this method, you should have a check
* func (this NestedInteger) GetInteger() int {}
*
* // Set this NestedInteger to hold a single integer.
* func (n *NestedInteger) SetInteger(value int) {}
*
* // Set this NestedInteger to hold a nested list and adds a nested integer to it.
* func (this *NestedInteger) Add(elem NestedInteger) {}
*
* // Return the nested list that this NestedInteger holds, if it holds a nested list
* // The list length is zero if this NestedInteger holds a single integer
* // You can access NestedInteger's List element directly if you want to modify it
* func (this NestedInteger) GetList() []*NestedInteger {}
*/
import "fmt"
type NestedIterator struct {
data []int
index int
}
func Constructor(nestedList []*NestedInteger) *NestedIterator {
data := []int{}
var flatten func(*[]int,[]*NestedInteger)
flatten = func(data *[]int,nestedList []*NestedInteger) {
for _, v := range nestedList {
if v.IsInteger() { // 如果是整数加到入 data列表中不需要展开
*data = append(*data,v.GetInteger())
continue
}
flatten(data,v.GetList())
}
}
flatten(&data,nestedList)
return &NestedIterator{ data, 0 }
}
func (this *NestedIterator) Next() int {
if !this.HasNext() {
return -1
}
this.index++
return this.data[this.index - 1]
}
func (this *NestedIterator) HasNext() bool {
return this.index < len(this.data)
}
func main() {
}