339. Nested List Weight Sum
Description
You are given a nested list of integers nestedList
. Each element is either an integer or a list whose elements may also be integers or other lists.
The depth of an integer is the number of lists that it is inside of. For example, the nested list [1,[2,2],[[3],2],1]
has each integer’s value set to its depth .
Return the sum of each integer in nestedList
multiplied by its depth .
Example 1:
![](https://assets.leetcode.com/uploads/2021/01/14/nestedlistweightsumex1.png)
1 | Input: nestedList = [[1,1],2,[1,1]] |
Example 2:
![](https://assets.leetcode.com/uploads/2021/01/14/nestedlistweightsumex2.png)
1 | Input: nestedList = [1,[4,[6]]] |
Example 3:
1 | Input: nestedList = [0] |
Constraints:
1 <= nestedList.length <= 50
- The values of the integers in the nested list is in the range
[-100, 100]
. - The maximum depth of any integer is less than or equal to
50
.
Hints/Notes
- 2025/01/22
- dfs
- Leetcode solution(checked)
Solution
Language: C++
1 | /** |