[LeetCode] 339 Nested List Weight Sum 嵌套链表权重和_java 339 嵌套链表权重和-优快云博客

本文链接：https://blog.youkuaiyun.com/xinqrs01/article/details/54015533

本文解析了LeetCode中NestedListWeightSum题目，介绍了如何通过递归方法解决嵌套列表权重和的问题，并提供了具体的代码实现。

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

[LeetCode] Nested List Weight Sum 嵌套链表权重和

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.

Example 1: Given the list [[1,1],2,[1,1]], return 10. (four 1’s at
depth 2, one 2 at depth 1)

Example 2: Given the list [1,[4,[6]]], return 27. (one 1 at depth 1,
one 4 at depth 2, and one 6 at depth 3; 1 + 4*2 + 6*3 = 27)

思路：
1. 嵌套的数据结构是有层次的，用stack就可以一层一层的解开嵌套,或者用recursive的方法: 如果有层级的明显标志，例如(,[等，可以用stack，本题还是用recursive的方法来解开这个数据结构；
2. 利用nestedInteger的方法，isInteger(), getInteger(), getList()

int depthSum(vector<NestedInteger>& nestedList) {
    return helper(ni,0);
}

int helper(vector<NestedInteger>& nestedList, int depth){

    int res=0;
    for(auto&k:nestedList){
        res+=k.isInteger?k.getInteger()*depth:helper(k.getList(),depth+1);
    }
    return res;
}