def validateBTN(self, n,left,right):
root = set(range(n))-set(left+right)
seen = [0]*n
def dfs(i):
if i==-1:
return 0
if seen[i]:
return -n
seen[i]=1
return dfs(left[i])+dfs(right[i])+1
return len(root)==1 and dfs(root.pop())==n
1361
最新推荐文章于 2024-07-15 10:54:42 发布