feat: update solutions to lc problem: No.0323

Author: yanglbme

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md

@@ -116,13 +116,7 @@ class Solution:
 
         for a, b in edges:
             p[find(b)] = find(a)
-        cnt = 0
-        visit = [False] * n
-        for i in range(n):
-            if not visit[find(i)]:
-                cnt += 1
-                visit[find(i)] = True
-        return cnt
+        return sum(i == find(i) for i in range(n))
 ```
 
 ### **Java**
@@ -132,7 +126,7 @@ class Solution:
 ```java
 class Solution {
     private int[] p;
-
+    
     public int countComponents(int n, int[][] edges) {
         p = new int[n];
         for (int i = 0; i < n; ++i) {
@@ -144,11 +138,9 @@ class Solution {
         }
 
         int cnt = 0;
-        boolean[] visit = new boolean[n];
         for (int i = 0; i < n; ++i) {
-            if (!visit[find(i)]) {
+            if (i == find(i)) {
                 ++cnt;
-                visit[find(i)] = true;
             }
         }
         return cnt;
@@ -182,14 +174,10 @@ public:
             p[find(b)] = find(a);
         }
         int cnt = 0;
-        vector<bool> visit(n, false);
         for (int i = 0; i < n; ++i)
         {
-            if (!visit[find(i)])
-            {
+            if (i == find(i))
                 ++cnt;
-                visit[find(i)] = true;
-            }
         }
         return cnt;
     }
@@ -219,14 +207,9 @@ func countComponents(n int, edges [][]int) int {
 		p[find(b)] = find(a)
 	}
 	cnt := 0
-	visit := make([]bool, n)
-	for i := 0; i < n; i++ {
-		visit[i] = false
-	}
 	for i := 0; i < n; i++ {
-		if !visit[find(i)] {
+		if i == find(i) {
 			cnt++
-			visit[find(i)] = true
 		}
 	}
 	return cnt

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README_EN.md

@@ -53,21 +53,15 @@ class Solution:
 
         for a, b in edges:
             p[find(b)] = find(a)
-        cnt = 0
-        visit = [False] * n
-        for i in range(n):
-            if not visit[find(i)]:
-                cnt += 1
-                visit[find(i)] = True
-        return cnt
+        return sum(i == find(i) for i in range(n))
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     private int[] p;
-
+    
     public int countComponents(int n, int[][] edges) {
         p = new int[n];
         for (int i = 0; i < n; ++i) {
@@ -79,11 +73,9 @@ class Solution {
         }
 
         int cnt = 0;
-        boolean[] visit = new boolean[n];
         for (int i = 0; i < n; ++i) {
-            if (!visit[find(i)]) {
+            if (i == find(i)) {
                 ++cnt;
-                visit[find(i)] = true;
             }
         }
         return cnt;
@@ -117,14 +109,10 @@ public:
             p[find(b)] = find(a);
         }
         int cnt = 0;
-        vector<bool> visit(n, false);
         for (int i = 0; i < n; ++i)
         {
-            if (!visit[find(i)])
-            {
+            if (i == find(i))
                 ++cnt;
-                visit[find(i)] = true;
-            }
         }
         return cnt;
     }
@@ -154,14 +142,9 @@ func countComponents(n int, edges [][]int) int {
 		p[find(b)] = find(a)
 	}
 	cnt := 0
-	visit := make([]bool, n)
-	for i := 0; i < n; i++ {
-		visit[i] = false
-	}
 	for i := 0; i < n; i++ {
-		if !visit[find(i)] {
+		if i == find(i) {
 			cnt++
-			visit[find(i)] = true
 		}
 	}
 	return cnt

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/Solution.cpp

@@ -14,14 +14,10 @@ class Solution {
             p[find(b)] = find(a);
         }
         int cnt = 0;
-        vector<bool> visit(n, false);
         for (int i = 0; i < n; ++i)
         {
-            if (!visit[find(i)])
-            {
+            if (i == find(i))
                 ++cnt;
-                visit[find(i)] = true;
-            }
         }
         return cnt;
     }

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/Solution.go

@@ -10,14 +10,9 @@ func countComponents(n int, edges [][]int) int {
 		p[find(b)] = find(a)
 	}
 	cnt := 0
-	visit := make([]bool, n)
 	for i := 0; i < n; i++ {
-		visit[i] = false
-	}
-	for i := 0; i < n; i++ {
-		if !visit[find(i)] {
+		if i == find(i) {
 			cnt++
-			visit[find(i)] = true
 		}
 	}
 	return cnt

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/Solution.java

@@ -12,11 +12,9 @@ public int countComponents(int n, int[][] edges) {
         }
 
         int cnt = 0;
-        boolean[] visit = new boolean[n];
         for (int i = 0; i < n; ++i) {
-            if (!visit[find(i)]) {
+            if (i == find(i)) {
                 ++cnt;
-                visit[find(i)] = true;
             }
         }
         return cnt;

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/Solution.py

@@ -9,10 +9,4 @@ def find(x):
 
         for a, b in edges:
             p[find(b)] = find(a)
-        cnt = 0
-        visit = [False] * n
-        for i in range(n):
-            if not visit[find(i)]:
-                cnt += 1
-                visit[find(i)] = True
-        return cnt
+        return sum(i == find(i) for i in range(n))