-
-
Notifications
You must be signed in to change notification settings - Fork 48
Expand file tree
/
Copy path0364-nested-list-weight-sum-ii.py
More file actions
73 lines (62 loc) · 2.05 KB
/
0364-nested-list-weight-sum-ii.py
File metadata and controls
73 lines (62 loc) · 2.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
# """
# 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
# """
#
# def add(self, elem):
# """
# 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]
# """
# time complexity: O(n)
# space complexity: O(n)
from typing import List
class Solution:
def depthSumInverse(self, nestedList: List[NestedInteger]) -> int:
calculations = []
def sumInverse(depth: int, nestedList: List[NestedInteger]):
for integer in nestedList:
if integer.isInteger():
calculations.append((integer.getInteger(), depth))
else:
sumInverse(depth+1, integer.getList())
sumInverse(1, nestedList)
if len(calculations) == 0:
return 0
maxDepth = max([v for k, v in calculations])
totalSum = 0
for value, depth in calculations:
totalSum += value*(maxDepth-depth+1)
return totalSum