Commitce06bc7

authored

Create 2385.py

1 parentecf3ada commitce06bc7Copy full SHA for ce06bc7

File tree

+37

-0

lines changed

+37

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode:`
	`3`	`+# def __init__(self, val=0, left=None, right=None):`
	`4`	`+# self.val = val`
	`5`	`+# self.left = left`
	`6`	`+# self.right = right`
	`7`	`+classSolution:`
	`8`	`+defamountOfTime(self,root:Optional[TreeNode],start:int)->int:`
	`9`	`+defdfs(node):`
	`10`	`+ifnodeisNone:`
	`11`	`+return`
	`12`	`+ifnode.left:`
	`13`	`+graph[node.val].append(node.left.val)`
	`14`	`+graph[node.left.val].append(node.val)`
	`15`	`+ifnode.right:`
	`16`	`+graph[node.val].append(node.right.val)`
	`17`	`+graph[node.right.val].append(node.val)`
	`18`	`+dfs(node.left)`
	`19`	`+dfs(node.right)`
	`20`	`+`
	`21`	`+graph=defaultdict(list)`
	`22`	`+dfs(root)`
	`23`	`+visited=set()`
	`24`	`+queue=deque([start])`
	`25`	`+time=-1`
	`26`	`+`
	`27`	`+whilequeue:`
	`28`	`+time+=1`
	`29`	`+for_inrange(len(queue)):`
	`30`	`+current_node=queue.popleft()`
	`31`	`+visited.add(current_node)`
	`32`	`+forneighboringraph[current_node]:`
	`33`	`+ifneighbornotinvisited:`
	`34`	`+queue.append(neighbor)`
	`35`	`+`
	`36`	`+returntime`
	`37`	`+`

Comments

(0)