chore: Move file's content "leetcode-master/107寻找存在的路径Java代码.md" to "leetcode-master/problems/kamacoder/0107.寻找存在的路径.md"

"leetcode-master/107寻找存在的路径Java代码.md" file merged in the wrong place and the content of it should be written in the "0107.寻找存在的路径.md".
This commit is contained in:
DengSchoo
2024-08-09 16:49:23 +08:00
committed by GitHub
parent 29bfd78c06
commit a681794bc8

View File

@ -158,7 +158,62 @@ int main() {
## 其他语言版本 ## 其他语言版本
### Java ### Java
```Java
import java.util.*;
public class Main{
public static void main(String[] args) {
int N, M;
Scanner scanner = new Scanner(System.in);
N = scanner.nextInt();
M = scanner.nextInt();
DisJoint disJoint = new DisJoint(N + 1);
for (int i = 0; i < M; ++i) {
disJoint.join(scanner.nextInt(), scanner.nextInt());
}
if(disJoint.isSame(scanner.nextInt(), scanner.nextInt())) {
System.out.println("1");
} else {
System.out.println("0");
}
}
}
//并查集模板
class DisJoint{
private int[] father;
public DisJoint(int N) {
father = new int[N];
for (int i = 0; i < N; ++i){
father[i] = i;
}
}
public int find(int n) {
return n == father[n] ? n : (father[n] = find(father[n]));
}
public void join (int n, int m) {
n = find(n);
m = find(m);
if (n == m) return;
father[m] = n;
}
public boolean isSame(int n, int m){
n = find(n);
m = find(m);
return n == m;
}
}
```
### Python ### Python