Nested List Weight Sum II | LeetCode Discuss
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. 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.
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 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; 13 + 42 + 6*1 = 17)
Read full article from Nested List Weight Sum II | LeetCode Discuss
No comments:
Post a Comment