-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathNested_List_Weight_Sum.cpp
34 lines (34 loc) · 1.25 KB
/
Nested_List_Weight_Sum.cpp
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
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* class NestedInteger {
* public:
* // Return true if this NestedInteger holds a single integer, rather than a nested list.
* bool isInteger() const;
*
* // 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
* int getInteger() const;
*
* // Return the nested list that this NestedInteger holds, if it holds a nested list
* // The result is undefined if this NestedInteger holds a single integer
* const vector<NestedInteger> &getList() const;
* };
*/
class Solution {
int depthSumRecur(vector<NestedInteger>& nestedList, int depth = 1) {
int sum = 0;
for(int i = 0; i < nestedList.size(); ++i) {
if(nestedList[i].isInteger()) {
sum += (nestedList[i].getInteger() * depth);
} else {
sum += depthSumRecur(nestedList[i].getList(), depth + 1);
}
}
return sum;
}
public:
int depthSum(vector<NestedInteger>& nestedList) {
return depthSumRecur(nestedList);
}
};