forked from xiaoyaoworm/Leetcode-java
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path364_NestedInteger.java
48 lines (47 loc) · 1.88 KB
/
364_NestedInteger.java
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
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* public interface NestedInteger {
* // Constructor initializes an empty nested list.
* public NestedInteger();
*
* // Constructor initializes a single integer.
* public NestedInteger(int value);
*
* // @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();
*
* // Set this NestedInteger to hold a single integer.
* public void setInteger(int value);
*
* // Set this NestedInteger to hold a nested list and adds a nested integer to it.
* public void add(NestedInteger ni);
*
* // @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();
* }
*/
public class Solution {
public int depthSumInverse(List<NestedInteger> nestedList) {
return dfs(nestedList, 0);
}
public int dfs(List<NestedInteger> nestedList, int sum){
List<NestedInteger> nextList = new ArrayList<NestedInteger>();
int nextSum = 0;
for(NestedInteger nestedInteger: nestedList){
if(nestedInteger.isInteger()){
sum+=nestedInteger.getInteger(); // we notice that the previous add will add in all level later, which is same as add one time this value * level.
} else{
nextList.addAll(nestedInteger.getList());
}
}
if(!nextList.isEmpty()) nextSum = dfs(nextList, sum);
else nextSum = 0;
return sum+nextSum;
}
}