-
Notifications
You must be signed in to change notification settings - Fork 0
/
NESTED_LIST_WEIGHT_SUM.cpp
52 lines (50 loc) · 1.67 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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* class NestedInteger {
* public:
* // Constructor initializes an empty nested list.
* NestedInteger();
*
* // Constructor initializes a single integer.
* NestedInteger(int value);
*
* // 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;
*
* // Set this NestedInteger to hold a single integer.
* void setInteger(int value);
*
* // Set this NestedInteger to hold a nested list and adds a nested integer to it.
* void add(const NestedInteger &ni);
*
* // 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 {
public:
int depthSum(vector<NestedInteger>& nestedList) {
return depthSumRes(nestedList,1);
}
int depthSumRes(vector<NestedInteger>& nestedList,int d) {
int sz = nestedList.size();
int res = 0;
for(int i=0;i<sz;i++){
if(nestedList[i].isInteger())
{
res+= d*nestedList[i].getInteger();
}
else
{
res+= depthSumRes(nestedList[i].getList(),d+1);
}
}
return res;
}
};