[Leetcode] 364. Nested List Weight Sum II 解题报告_c++ leetcode 364 nested list weight sum ii-优快云博客

本文介绍了一种针对嵌套整数列表的加权深度求和算法，该算法首先计算列表的最大深度，然后根据元素所在层级的权重进行加权求和。通过两个步骤实现：1）确定NestedList的最大深度；2）按深度递归计算加权和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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)

思路：

主要分为两个步骤吧：1）求出NestedList的深度；2）依据深度递归进行求解。其中每个步骤都比较简单，无需赘述。

代码：

/**
 * // 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 depthSumInverse(vector<NestedInteger>& nestedList) {
        int max_depth = getDepth(nestedList);
        return depthSumInverse(nestedList, max_depth);
    }
private:
    int depthSumInverse(vector<NestedInteger>& nestedList, int depth) {
        int ans = 0;
        for (int i = 0; i < nestedList.size(); ++i) {
            if (nestedList[i].isInteger()) {
                ans += depth * nestedList[i].getInteger();
            }
            else {
                ans += depthSumInverse(nestedList[i].getList(), depth - 1);
            }
        }
        return ans;
    }
    
    int getDepth(vector<NestedInteger>& nestedList) {
        if (nestedList.size() == 0) {
            return 0;
        }
        int max_depth = 1;
        for (int i = 0; i < nestedList.size(); ++i) {
            if (!nestedList[i].isInteger()) {
                max_depth = max(max_depth, getDepth(nestedList[i].getList()) + 1);
            }
        }
        return max_depth;
    }
};