339. Nested List Weight Sum

This question asks us to recursively calculate the sum for a list of nestedList items which could either be an integer or another list of integers.

class Solution:
    def depthSum(self, nestedList: List[NestedInteger]) -> int:
        def recurse(number: NestedInteger, depth: int):
            if number.isInteger():
                return number.getInteger() * depth
            return sum(recurse(n, depth + 1) for n in number.getList())
        
        return sum(recurse(n, 1) for n in nestedList)