Leetcode Everyday: 339. Nested List Weight Sum

最新推荐文章于 2020-05-10 12:23:22 发布

jimhust

最新推荐文章于 2020-05-10 12:23:22 发布

阅读量273

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/jimhust/article/details/51378401

版权

leetcode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

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)