Nested List Weight Sum II
Last updated
Was this helpful?
Last updated
Was this helpful?
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 thewhere 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:
Example 2:
分析
和第一题比就是level倒了
bfs,每次叠加第一层的level sum 这样就不用*level了
dfs:先dfs计算depth,再用depth再dfs计算sum