-
Notifications
You must be signed in to change notification settings - Fork 1
/
LeetCode-339-Nested-List-Weight-Sum.java
46 lines (45 loc) · 1.68 KB
/
LeetCode-339-Nested-List-Weight-Sum.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
/**
* // 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();
* }
*/
class Solution {
public int depthSum(List<NestedInteger> nestedList) {
if (nestedList == null || nestedList.size() == 0) return 0;
int[] sum = new int[1];
recursive(nestedList, 1, sum);
return sum[0];
}
public void recursive(List<NestedInteger> nestedList, int level, int[] sum) {
for (NestedInteger ni : nestedList) {
if (ni.isInteger()) {
sum[0] += level * ni.getInteger();
} else {
recursive(ni.getList(), level + 1, sum);
}
}
}
}