# LeetCode: 339. 嵌套列表权重和¶

## 1、题目描述¶

示例 1:



## 2、解题思路¶

DFS深度优先搜索

# """
# This is the interface that allows for creating nested lists.
# You should not implement it, or speculate about its implementation
# """
#class NestedInteger:
#    def __init__(self, value=None):
#        """
#        If value is not specified, initializes an empty list.
#        Otherwise initializes a single integer equal to value.
#        """
#
#    def isInteger(self):
#        """
#        @return True if this NestedInteger holds a single integer, rather than a nested list.
#        :rtype bool
#        """
#
#        """
#        Set this NestedInteger to hold a nested list and adds a nested integer elem to it.
#        :rtype void
#        """
#
#    def setInteger(self, value):
#        """
#        Set this NestedInteger to hold a single integer equal to value.
#        :rtype void
#        """
#
#    def getInteger(self):
#        """
#        @return the single integer that this NestedInteger holds, if it holds a single integer
#        Return None if this NestedInteger holds a nested list
#        :rtype int
#        """
#
#    def getList(self):
#        """
#        @return the nested list that this NestedInteger holds, if it holds a nested list
#        Return None if this NestedInteger holds a single integer
#        :rtype List[NestedInteger]
#        """

class Solution:
def depthSum(self, nestedList: List[NestedInteger]) -> int:
return self.dfs(nestedList,1)

def dfs(self,nestedList: List[NestedInteger],level):
temp = 0
for i in nestedList:
if i.isInteger():
temp += level * i.getInteger()
else:
temp += self.dfs(i.getList(),level+1)

return temp