From a681794bc82acab371c8f73076b16d60f29708d3 Mon Sep 17 00:00:00 2001
From: DengSchoo <46556279+DengSchoo@users.noreply.github.com>
Date: Fri, 9 Aug 2024 16:49:23 +0800
Subject: [PATCH 1/2] =?UTF-8?q?chore:=20Move=20file's=20content=20"leetcod?=
 =?UTF-8?q?e-master/107=E5=AF=BB=E6=89=BE=E5=AD=98=E5=9C=A8=E7=9A=84?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84Java=E4=BB=A3=E7=A0=81.md"=20to=20"leetcode-m?=
 =?UTF-8?q?aster/problems/kamacoder/0107.=E5=AF=BB=E6=89=BE=E5=AD=98?=
 =?UTF-8?q?=E5=9C=A8=E7=9A=84=E8=B7=AF=E5=BE=84.md"?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

"leetcode-master/107寻找存在的路径Java代码.md" file merged in the wrong place and the content of it should be written in the "0107.寻找存在的路径.md".
---
 .../kamacoder/0107.寻找存在的路径.md   | 57 ++++++++++++++++++-
 1 file changed, 56 insertions(+), 1 deletion(-)

diff --git a/problems/kamacoder/0107.寻找存在的路径.md b/problems/kamacoder/0107.寻找存在的路径.md
index 906609c9..70339a9d 100644
--- a/problems/kamacoder/0107.寻找存在的路径.md
+++ b/problems/kamacoder/0107.寻找存在的路径.md
@@ -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
 

From 216ee8d1e934826e5fc7f4cf1499bd3b711462d0 Mon Sep 17 00:00:00 2001
From: DengSchoo <46556279+DengSchoo@users.noreply.github.com>
Date: Fri, 9 Aug 2024 17:59:30 +0800
Subject: [PATCH 2/2] =?UTF-8?q?chore:=20Move=20file's=20content=20"leetcod?=
 =?UTF-8?q?e-master/107=E5=AF=BB=E6=89=BE=E5=AD=98=E5=9C=A8=E7=9A=84?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84Java=E4=BB=A3=E7=A0=81.md"=20to=20leetcode-ma?=
 =?UTF-8?q?ster/problems/kamacoder/0107.=E5=AF=BB=E6=89=BE=E5=AD=98?=
 =?UTF-8?q?=E5=9C=A8=E7=9A=84=E8=B7=AF=E5=BE=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

chore: Move file's content "leetcode-master/107寻找存在的路径Java代码.md" to leetcode-master/problems/kamacoder/0107.寻找存在的路径.md
---
 107寻找存在的路径Java代码 | 56 ------------------------------
 1 file changed, 56 deletions(-)
 delete mode 100644 107寻找存在的路径Java代码

diff --git a/107寻找存在的路径Java代码 b/107寻找存在的路径Java代码
deleted file mode 100644
index 7b83ca26..00000000
--- a/107寻找存在的路径Java代码
+++ /dev/null
@@ -1,56 +0,0 @@
-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;
-    }
- 
-}
-
-```