Commit07eb507

authored

Update union_find.md

1 parent56ee84d commit07eb507Copy full SHA for 07eb507

File tree

+22

-1

lines changed

+22

-1

lines changed

Lines changed: 22 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -35,6 +35,27 @@ class Solution:`
`35`	`35`	`return edge`
`36`	`36`	```
`37`	`37`
	`38`	+```Python
	`39`	`+classSolution:`
	`40`	`+deffindRedundantConnection(self,edges: List[List[int]]) -> List[int]:`
	`41`	`+ parents=list(range(len(edges)+1))`
	`42`	`+`
	`43`	`+deffind(index):`
	`44`	`+if parents[index]!= index:`
	`45`	`+ parents[index]= find(parents[index])`
	`46`	`+return parents[index]`
	`47`	`+`
	`48`	`+defunion(index1,index2):`
	`49`	`+ parents[find(index1)]= find(index2)`
	`50`	`+`
	`51`	`+for node1, node2in edges:`
	`52`	`+if find(node1)!= find(node2):`
	`53`	`+ union(node1, node2)`
	`54`	`+else:`
	`55`	`+return [node1, node2]`
	`56`	`+return []`
	`57`	+```
	`58`	`+`
`38`	`59`	`###[accounts-merge](https://leetcode-cn.com/problems/accounts-merge/)`
`39`	`60`
`40`	`61`	```Python
`@@ -163,4 +184,4 @@ class Solution:`
`163`	`184`	`for w, x, yin edges:`
`164`	`185`	`if union(x, y)and find(0)== find(N):# early return without constructing MST`
`165`	`186`	`return w`
`166`		-```
	`187`	+```

Comments

(0)