题目:原题链接(中等)
标签:深度优先搜索
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( N ) O(N) O(N) | O ( N ) O(N) O(N) | 160ms (13.79%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def deleteTreeNodes(self, nodes: int, parent: List[int], value: List[int]) -> int:
graph = collections.defaultdict(set)
for i in range(nodes):
graph[parent[i]].add(i)
root = graph[-1].pop()
def dfs(node):
"""返回 剩余节点数,和"""
num0 = 1
val0 = value[node]
for nxt in graph[node]:
num1, val1 = dfs(nxt)
num0 += num1
val0 += val1
if val0 == 0:
return 0, 0
else:
return num0, val0
return dfs(root)[0]