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

[pull] master from youngyangyang04:master #351

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 5 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Sep 26, 2023
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
添加了684.冗余连接 的Python并查集简洁写法
  • Loading branch information
Snow-Ye committed Sep 15, 2023
commit 23ca9e43e5a15bdbbf69744515b94736ac1d3b0d
17 changes: 17 additions & 0 deletions problems/0684.冗余连接.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -256,6 +256,23 @@ class Solution:
return []
```

### Python简洁写法:

```python
class Solution:
def findRedundantConnection(self, edges: List[List[int]]) -> List[int]:
n = len(edges)
p = [i for i in range(n+1)]
def find(i):
if p[i] != i:
p[i] = find(p[i])
return p[i]
for u, v in edges:
if p[find(u)] == find(v):
return [u, v]
p[find(u)] = find(v)
```

### Go

```go
Expand Down

AltStyle によって変換されたページ (->オリジナル) /