Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

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

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commite5f8b59

Browse files
committed
1971-find-if-path-exists-in-graph-2.md Reworded.
1 parentb2f958f commite5f8b59

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎en/1001-2000/1971-find-if-path-exists-in-graph-2.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -101,8 +101,8 @@ class Solution:
101101

102102
###Another UnionFind algorithm (using a map and an array of set)
103103
* This solution is slower than the`standard UnionFind algorithm`, but it is straightforward.
104-
* The applicability of this solution is not as wide as the`standard UnionFind algorithm` because data in a set don't have association.
105-
The`standard UnionFind algorithm`has a`parent` array with association ofnodes.
104+
* The applicability of this solution is not as wide as the`standard UnionFind algorithm` because data in a set don't have association, yet the`standard UnionFind algorithm` has a`parents` array with association of nodes.
105+
*The`standard UnionFind algorithm`should be the first choice instead ofthis one.
106106

107107
```python
108108
classSolution:

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp