# 364. Nested List Weight Sum II 加权嵌套序列和 II

@TOC

## # 题目描述

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:

``````Input: [[1,1],2,[1,1]]
Output: 8
Explanation: Four 1's at depth 1, one 2 at depth 2.
``````

Example 2:

``````Input: [1,[4,[6]]]
Output: 17
Explanation: One 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17.
``````

## # 解题方法

### # 递归

C++代码如下：

``````/**
* // 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.
*
*     // 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 depthSumInverse(vector<NestedInteger>& nestedList) {
int d = depth(nestedList);
return depthSum(nestedList, d);
}
int depthSum(vector<NestedInteger>& nestedList, int depth) {
if (nestedList.empty()) return 0;
int res = 0;
for (NestedInteger ni : nestedList) {
if (ni.isInteger()) {
res += ni.getInteger() * depth;
} else {
res += depthSum(ni.getList(), depth - 1);
}
}
return res;
}
int depth(vector<NestedInteger>& nestedList) {
if (nestedList.empty()) return 0;
int max_children = 0;
for (NestedInteger ni : nestedList) {
max_children = max(max_children, depth(ni.getList()));
}
return max_children + 1;
}
};
``````

## # 日期

2019 年 9 月 21 日 —— 莫生气，我若气病谁如意