Commit175f9df

committed

1584-min-cost-to-connect-all-points-2.md Perfected code.

1 parent6c22e3a commit175f9dfCopy full SHA for 175f9df

File tree

2 files changed

+34

-22

lines changed

en/1001-2000
- 1584-min-cost-to-connect-all-points-2.md
zh/1001-2000
- 1584-min-cost-to-connect-all-points-2.md

2 files changed

+34

-22

lines changed

`‎en/1001-2000/1584-min-cost-to-connect-all-points-2.md‎`

Lines changed: 17 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -73,10 +73,10 @@ This page, I will only talk about the solution of Kruskal's Algorithm.`
`73`	`73`	```python
`74`	`74`	`classSolution:`
`75`	`75`	`def__init__(self):`
`76`		`-self.parent= []`
	`76`	`+self.parents= []`
`77`	`77`
`78`	`78`	`defminCostConnectPoints(self,points: List[List[int]]) ->int:`
`79`		`-self.parent=list(range(len(points)))`
	`79`	`+self.parents=list(range(len(points)))`
`80`	`80`	`result=0`
`81`	`81`	`edged_points= []`
`82`	`82`
`@@ -85,43 +85,49 @@ class Solution:`
`85`	`85`	`distance=abs(point[0]- points[j][0])+ \`
`86`	`86`	`abs(point[1]- points[j][1])`
`87`	`87`	`heapq.heappush(edged_points, (distance, i, j))`
`88`		`-`
	`88`	`+`
`89`	`89`	`while edged_points:`
`90`	`90`	`distance, i, j= heapq.heappop(edged_points)`
`91`	`91`
`92`		`-ifself.same_root(i, j):`
	`92`	`+ifself.is_same_root(i, j):`
`93`	`93`	`continue`
`94`	`94`
`95`	`95`	`self.unite(i, j)`
`96`	`96`
`97`	`97`	`result+= distance`
`98`		`-`
	`98`	`+`
`99`	`99`	`return result`
`100`	`100`
`101`	`101`	`defunite(self,x,y):`
`102`	`102`	`root_x=self.find_root(x)`
`103`	`103`	`root_y=self.find_root(y)`
`104`		`-self.parent[root_y]= root_x`
	`104`	`+`
	`105`	`+self.parents[root_y]= root_x`
`105`	`106`
`106`	`107`	`deffind_root(self,x):`
`107`		`-if x==self.parent[x]:`
	`108`	`+ parent=self.parents[x]`
	`109`	`+`
	`110`	`+if x== parent:`
`108`	`111`	`return x`
`109`	`112`
`110`		`-self.parent[x]=self.find_root(self.parent[x])`
	`113`	`+ root=self.find_root(parent)`
	`114`	`+`
	`115`	`+self.parents[x]= root`
`111`	`116`
`112`		`-returnself.parent[x]`
	`117`	`+returnroot`
`113`	`118`
`114`		`-defsame_root(self,x,y):`
	`119`	`+defis_same_root(self,x,y):`
`115`	`120`	`returnself.find_root(x)==self.find_root(y)`
`116`	`121`	```
`117`	`122`
`118`	`123`	`##Java`
`119`	`124`	```java
	`125`	`+// Welcome to create a PR to complete the code of this language, thanks!`
`120`	`126`	```
`121`	`127`
`122`	`128`	`##Python`
`123`	`129`	```python
`124`		`-// Welcome to create aPR to complete the code of this language, thanks!`
	`130`	`+# Welcome to create a PR to complete the code of this language, thanks!`
`125`	`131`	```
`126`	`132`
`127`	`133`	`##C++`

`‎zh/1001-2000/1584-min-cost-to-connect-all-points-2.md‎`

Lines changed: 17 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -73,10 +73,10 @@ This page, I will only talk about the solution of Kruskal's Algorithm.`
`73`	`73`	```python
`74`	`74`	`classSolution:`
`75`	`75`	`def__init__(self):`
`76`		`-self.parent= []`
	`76`	`+self.parents= []`
`77`	`77`
`78`	`78`	`defminCostConnectPoints(self,points: List[List[int]]) ->int:`
`79`		`-self.parent=list(range(len(points)))`
	`79`	`+self.parents=list(range(len(points)))`
`80`	`80`	`result=0`
`81`	`81`	`edged_points= []`
`82`	`82`
`@@ -85,43 +85,49 @@ class Solution:`
`85`	`85`	`distance=abs(point[0]- points[j][0])+ \`
`86`	`86`	`abs(point[1]- points[j][1])`
`87`	`87`	`heapq.heappush(edged_points, (distance, i, j))`
`88`		`-`
	`88`	`+`
`89`	`89`	`while edged_points:`
`90`	`90`	`distance, i, j= heapq.heappop(edged_points)`
`91`	`91`
`92`		`-ifself.same_root(i, j):`
	`92`	`+ifself.is_same_root(i, j):`
`93`	`93`	`continue`
`94`	`94`
`95`	`95`	`self.unite(i, j)`
`96`	`96`
`97`	`97`	`result+= distance`
`98`		`-`
	`98`	`+`
`99`	`99`	`return result`
`100`	`100`
`101`	`101`	`defunite(self,x,y):`
`102`	`102`	`root_x=self.find_root(x)`
`103`	`103`	`root_y=self.find_root(y)`
`104`		`-self.parent[root_y]= root_x`
	`104`	`+`
	`105`	`+self.parents[root_y]= root_x`
`105`	`106`
`106`	`107`	`deffind_root(self,x):`
`107`		`-if x==self.parent[x]:`
	`108`	`+ parent=self.parents[x]`
	`109`	`+`
	`110`	`+if x== parent:`
`108`	`111`	`return x`
`109`	`112`
`110`		`-self.parent[x]=self.find_root(self.parent[x])`
	`113`	`+ root=self.find_root(parent)`
	`114`	`+`
	`115`	`+self.parents[x]= root`
`111`	`116`
`112`		`-returnself.parent[x]`
	`117`	`+returnroot`
`113`	`118`
`114`		`-defsame_root(self,x,y):`
	`119`	`+defis_same_root(self,x,y):`
`115`	`120`	`returnself.find_root(x)==self.find_root(y)`
`116`	`121`	```
`117`	`122`
`118`	`123`	`##Java`
`119`	`124`	```java
	`125`	`+// Welcome to create a PR to complete the code of this language, thanks!`
`120`	`126`	```
`121`	`127`
`122`	`128`	`##Python`
`123`	`129`	```python
`124`		`-// Welcome to create aPR to complete the code of this language, thanks!`
	`130`	`+# Welcome to create a PR to complete the code of this language, thanks!`
`125`	`131`	```
`126`	`132`
`127`	`133`	`##C++`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit175f9df

File tree

2 files changed

2 files changed

`‎en/1001-2000/1584-min-cost-to-connect-all-points-2.md‎`

`‎zh/1001-2000/1584-min-cost-to-connect-all-points-2.md‎`

0 commit comments