-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNested_List_Weight_Sum_II.java
More file actions
61 lines (48 loc) · 1.88 KB
/
Copy pathNested_List_Weight_Sum_II.java
File metadata and controls
61 lines (48 loc) · 1.88 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
364. Nested List Weight Sum II
Given a nested list of integers, return the sum of all integers in the list weighted by their depth.
Each element is either an integer, or a list -- whose elements may also be integers or other lists.
Different from the previous question where weight is increasing from root to leaf, now the weight is defined from bottom up. i.e., the leaf level integers have weight 1, and the root level integers have the largest weight.
Example 1:
Given the list [[1,1],2,[1,1]], return 8. (four 1''s at depth 1, one 2 at depth 2)
Example 2:
Given the list [1,[4,[6]]], return 17. (one 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17)
public class Solution {
public int depthSumInverse(List<NestedInteger> nestedList) {
List<Integer> res = new ArrayList<>();
sum(nestedList, res, 0);
int total = 0;
int w = res.size();
for(Integer i : res){
total += i * w--;
}
return total;
}
private void sum(List<NestedInteger> nestedList, List<Integer> list, int depth){
while(depth >= list.size()){
list.add(0);
}
for(NestedInteger ni : nestedList){
if(ni.isInteger()){
list.set(depth, list.get(depth) + ni.getInteger());
}else{
sum(ni.getList(), list, depth+1);
}
}
}
}
///////////////////
public int depthSumInverse(List<NestedInteger> nestedList) {
int unweighted = 0, weighted = 0;
while (!nestedList.isEmpty()) {
List<NestedInteger> nextLevel = new ArrayList<>();
for (NestedInteger ni : nestedList) {
if (ni.isInteger())
unweighted += ni.getInteger();
else
nextLevel.addAll(ni.getList());
}
weighted += unweighted;
nestedList = nextLevel;
}
return weighted;
}