feat: update solutions to lc/lcof2 problems

lc No.0893 & lcof2 No.117.Similar String Groups

Author: yanglbme

lcof2/剑指 Offer II 117. 相似的字符串/README.md

@@ -119,26 +119,17 @@ d[find(a)] = distance
 ```python
 class Solution:
     def numSimilarGroups(self, strs: List[str]) -> int:
-        n = len(strs)
-        p = list(range(n))
-
         def find(x):
             if p[x] != x:
                 p[x] = find(p[x])
             return p[x]
-
-        def check(a, b):
-            cnt = 0
-            for i, c in enumerate(a):
-                if c != b[i]:
-                    cnt += 1
-            return cnt <= 2
-
+        
+        n, l = len(strs), len(strs[0])
+        p = list(range(n))
         for i in range(n):
             for j in range(i + 1, n):
-                if check(strs[i], strs[j]):
+                if sum(strs[i][k] != strs[j][k] for k in range(l)) <= 2:
                     p[find(i)] = find(j)
-
         return sum(i == find(i) for i in range(n))
 ```
 
@@ -198,30 +189,27 @@ class Solution {
 class Solution {
 public:
     vector<int> p;
+
     int numSimilarGroups(vector<string>& strs) {
         int n = strs.size();
-        for (int i = 0; i < n; ++i) p.push_back(i);
+        p.resize(n);
+        for (int i = 0; i < n; ++i) p[i] = i;
         for (int i = 0; i < n; ++i)
-        {
             for (int j = i + 1; j < n; ++j)
-            {
                 if (check(strs[i], strs[j]))
                     p[find(i)] = find(j);
-            }
-        }
-        int res = 0;
+        int ans = 0;
         for (int i = 0; i < n; ++i)
-        {
-            if (i == find(i)) ++res;
-        }
-        return res;
+            if (i == find(i))
+                ++ans;
+        return ans;
     }
 
     bool check(string a, string b) {
         int cnt = 0;
-        int n = a.size();
-        for (int i = 0; i < n; ++i)
-            if (a[i] != b[i]) ++cnt;
+        for (int i = 0; i < a.size(); ++i)
+            if (a[i] != b[i])
+                ++cnt;
         return cnt <= 2;
     }
 
@@ -235,46 +223,42 @@ public:
 ### **Go**
 
 ```go
-var p []int
-
 func numSimilarGroups(strs []string) int {
 	n := len(strs)
-	p = make([]int, n)
-	for i := 0; i < n; i++ {
+	p := make([]int, n)
+	for i := range p {
 		p[i] = i
 	}
-	for i := 0; i < n; i++ {
-		for j := i + 1; j < n; j++ {
-			if !check(strs[i], strs[j]) {
-				continue
+	check := func(a, b string) bool {
+		cnt := 0
+		for i := range a {
+			if a[i] != b[i] {
+				cnt++
 			}
-			p[find(i)] = find(j)
 		}
+		return cnt <= 2
 	}
-	res := 0
-	for i := 0; i < n; i++ {
-		if i == find(i) {
-			res++
+	var find func(x int) int
+	find = func(x int) int {
+		if p[x] != x {
+			p[x] = find(p[x])
 		}
+		return p[x]
 	}
-	return res
-}
-
-func check(a, b string) bool {
-	cnt, n := 0, len(a)
 	for i := 0; i < n; i++ {
-		if a[i] != b[i] {
-			cnt++
+		for j := i + 1; j < n; j++ {
+			if check(strs[i], strs[j]) {
+				p[find(i)] = find(j)
+			}
 		}
 	}
-	return cnt <= 2
-}
-
-func find(x int) int {
-	if p[x] != x {
-		p[x] = find(p[x])
+	ans := 0
+	for i := 0; i < n; i++ {
+		if i == find(i) {
+			ans++
+		}
 	}
-	return p[x]
+	return ans
 }
 ```
 

lcof2/剑指 Offer II 117. 相似的字符串/Solution.cpp

@@ -1,30 +1,27 @@
 class Solution {
 public:
     vector<int> p;
+
     int numSimilarGroups(vector<string>& strs) {
         int n = strs.size();
-        for (int i = 0; i < n; ++i) p.push_back(i);
+        p.resize(n);
+        for (int i = 0; i < n; ++i) p[i] = i;
         for (int i = 0; i < n; ++i)
-        {
             for (int j = i + 1; j < n; ++j)
-            {
                 if (check(strs[i], strs[j]))
                     p[find(i)] = find(j);
-            }
-        }
-        int res = 0;
+        int ans = 0;
         for (int i = 0; i < n; ++i)
-        {
-            if (i == find(i)) ++res;
-        }
-        return res;
+            if (i == find(i))
+                ++ans;
+        return ans;
     }
 
     bool check(string a, string b) {
         int cnt = 0;
-        int n = a.size();
-        for (int i = 0; i < n; ++i)
-            if (a[i] != b[i]) ++cnt;
+        for (int i = 0; i < a.size(); ++i)
+            if (a[i] != b[i])
+                ++cnt;
         return cnt <= 2;
     }
 

lcof2/剑指 Offer II 117. 相似的字符串/Solution.go

@@ -1,41 +1,37 @@
-var p []int
-
 func numSimilarGroups(strs []string) int {
 	n := len(strs)
-	p = make([]int, n)
-	for i := 0; i < n; i++ {
+	p := make([]int, n)
+	for i := range p {
 		p[i] = i
 	}
-	for i := 0; i < n; i++ {
-		for j := i + 1; j < n; j++ {
-			if !check(strs[i], strs[j]) {
-				continue
+	check := func(a, b string) bool {
+		cnt := 0
+		for i := range a {
+			if a[i] != b[i] {
+				cnt++
 			}
-			p[find(i)] = find(j)
 		}
+		return cnt <= 2
 	}
-	res := 0
-	for i := 0; i < n; i++ {
-		if i == find(i) {
-			res++
+	var find func(x int) int
+	find = func(x int) int {
+		if p[x] != x {
+			p[x] = find(p[x])
 		}
+		return p[x]
 	}
-	return res
-}
-
-func check(a, b string) bool {
-	cnt, n := 0, len(a)
 	for i := 0; i < n; i++ {
-		if a[i] != b[i] {
-			cnt++
+		for j := i + 1; j < n; j++ {
+			if check(strs[i], strs[j]) {
+				p[find(i)] = find(j)
+			}
 		}
 	}
-	return cnt <= 2
-}
-
-func find(x int) int {
-	if p[x] != x {
-		p[x] = find(p[x])
+	ans := 0
+	for i := 0; i < n; i++ {
+		if i == find(i) {
+			ans++
+		}
 	}
-	return p[x]
+	return ans
 }

lcof2/剑指 Offer II 117. 相似的字符串/Solution.java

@@ -14,30 +14,29 @@ public int numSimilarGroups(String[] strs) {
                 }
             }
         }
-        int res = 0;
+        int ans = 0;
         for (int i = 0; i < n; ++i) {
             if (i == find(i)) {
-                ++res;
+                ++ans;
             }
         }
-        return res;
+        return ans;
+    }
+
+    private int find(int x) {
+        if (p[x] != x) {
+            p[x] = find(p[x]);
+        }
+        return p[x];
     }
 
     private boolean check(String a, String b) {
         int cnt = 0;
-        int n = a.length();
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0; i < a.length(); ++i) {
             if (a.charAt(i) != b.charAt(i)) {
                 ++cnt;
             }
         }
         return cnt <= 2;
     }
-
-    private int find(int x) {
-        if (p[x] != x) {
-            p[x] = find(p[x]);
-        }
-        return p[x];
-    }
 }

lcof2/剑指 Offer II 117. 相似的字符串/Solution.py

@@ -1,23 +1,14 @@
 class Solution:
     def numSimilarGroups(self, strs: List[str]) -> int:
-        n = len(strs)
-        p = list(range(n))
-
         def find(x):
             if p[x] != x:
                 p[x] = find(p[x])
             return p[x]
 
-        def check(a, b):
-            cnt = 0
-            for i, c in enumerate(a):
-                if c != b[i]:
-                    cnt += 1
-            return cnt <= 2
-
+        n, l = len(strs), len(strs[0])
+        p = list(range(n))
         for i in range(n):
             for j in range(i + 1, n):
-                if check(strs[i], strs[j]):
+                if sum(strs[i][k] != strs[j][k] for k in range(l)) <= 2:
                     p[find(i)] = find(j)
-
         return sum(i == find(i) for i in range(n))