feat: add solutions to lc problem: No.0914

* No.0914.X of a Kind in a Deck of Cards

Author: yanglbme

solution/0900-0999/0914.X of a Kind in a Deck of Cards/README.md

@@ -47,6 +47,14 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：最大公约数**
+
+我们先用数组或哈希表 `cnt` 统计每个数字出现的次数，只有当 $X$ 是所有数字出现次数的约数时，即 $X$ 是所有 `cnt[i]` 的最大公约数的约数时，才能满足题意。
+
+因此，我们求出所有数字出现次数的最大公约数 $g$，然后判断其是否大于等于 $2$ 即可。
+
+时间复杂度 $O(n\log C)$，其中 $n$ 是数组 `deck` 的长度，而 $C$ 是数组 `deck` 中的最大值。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -67,12 +75,12 @@ class Solution:
 ```java
 class Solution {
     public boolean hasGroupsSizeX(int[] deck) {
-        int[] counter = new int[10000];
-        for (int d : deck) {
-            ++counter[d];
+        int[] cnt = new int[10000];
+        for (int v : deck) {
+            ++cnt[v];
         }
         int g = -1;
-        for (int v : counter) {
+        for (int v : cnt) {
             if (v > 0) {
                 g = g == -1 ? v : gcd(g, v);
             }
@@ -92,38 +100,29 @@ class Solution {
 class Solution {
 public:
     bool hasGroupsSizeX(vector<int>& deck) {
-        vector<int> counter(10000);
-        for (int& d : deck) ++counter[d];
+        int cnt[10000] = {0};
+        for (int& v : deck) ++cnt[v];
         int g = -1;
-        for (int& v : counter)
-            if (v > 0)
-                g = g == -1 ? v : gcd(g, v);
+        for (int& v : cnt) {
+            if (v) {
+                g = g == -1 ? v : __gcd(g, v);
+            }
+        }
         return g >= 2;
     }
-
-    int gcd(int a, int b) {
-        return b == 0 ? a : gcd(b, a % b);
-    }
 };
 ```
 
 ### **Go**
 
 ```go
 func hasGroupsSizeX(deck []int) bool {
-	counter := make([]int, 10000)
-	for _, d := range deck {
-		counter[d]++
-	}
-	var gcd func(a, b int) int
-	gcd = func(a, b int) int {
-		if b == 0 {
-			return a
-		}
-		return gcd(b, a%b)
+	cnt := make([]int, 10000)
+	for _, v := range deck {
+		cnt[v]++
 	}
 	g := -1
-	for _, v := range counter {
+	for _, v := range cnt {
 		if v > 0 {
 			if g == -1 {
 				g = v
@@ -134,6 +133,13 @@ func hasGroupsSizeX(deck []int) bool {
 	}
 	return g >= 2
 }
+
+func gcd(a, b int) int {
+	if b == 0 {
+		return a
+	}
+	return gcd(b, a%b)
+}
 ```
 
 ### **...**

solution/0900-0999/0914.X of a Kind in a Deck of Cards/README_EN.md

@@ -58,12 +58,12 @@ class Solution:
 ```java
 class Solution {
     public boolean hasGroupsSizeX(int[] deck) {
-        int[] counter = new int[10000];
-        for (int d : deck) {
-            ++counter[d];
+        int[] cnt = new int[10000];
+        for (int v : deck) {
+            ++cnt[v];
         }
         int g = -1;
-        for (int v : counter) {
+        for (int v : cnt) {
             if (v > 0) {
                 g = g == -1 ? v : gcd(g, v);
             }
@@ -83,38 +83,29 @@ class Solution {
 class Solution {
 public:
     bool hasGroupsSizeX(vector<int>& deck) {
-        vector<int> counter(10000);
-        for (int& d : deck) ++counter[d];
+        int cnt[10000] = {0};
+        for (int& v : deck) ++cnt[v];
         int g = -1;
-        for (int& v : counter)
-            if (v > 0)
-                g = g == -1 ? v : gcd(g, v);
+        for (int& v : cnt) {
+            if (v) {
+                g = g == -1 ? v : __gcd(g, v);
+            }
+        }
         return g >= 2;
     }
-
-    int gcd(int a, int b) {
-        return b == 0 ? a : gcd(b, a % b);
-    }
 };
 ```
 
 ### **Go**
 
 ```go
 func hasGroupsSizeX(deck []int) bool {
-	counter := make([]int, 10000)
-	for _, d := range deck {
-		counter[d]++
-	}
-	var gcd func(a, b int) int
-	gcd = func(a, b int) int {
-		if b == 0 {
-			return a
-		}
-		return gcd(b, a%b)
+	cnt := make([]int, 10000)
+	for _, v := range deck {
+		cnt[v]++
 	}
 	g := -1
-	for _, v := range counter {
+	for _, v := range cnt {
 		if v > 0 {
 			if g == -1 {
 				g = v
@@ -125,6 +116,13 @@ func hasGroupsSizeX(deck []int) bool {
 	}
 	return g >= 2
 }
+
+func gcd(a, b int) int {
+	if b == 0 {
+		return a
+	}
+	return gcd(b, a%b)
+}
 ```
 
 ### **...**

solution/0900-0999/0914.X of a Kind in a Deck of Cards/Solution.cpp

@@ -1,16 +1,14 @@
 class Solution {
 public:
     bool hasGroupsSizeX(vector<int>& deck) {
-        vector<int> counter(10000);
-        for (int& d : deck) ++counter[d];
+        int cnt[10000] = {0};
+        for (int& v : deck) ++cnt[v];
         int g = -1;
-        for (int& v : counter)
-            if (v > 0)
-                g = g == -1 ? v : gcd(g, v);
+        for (int& v : cnt) {
+            if (v) {
+                g = g == -1 ? v : __gcd(g, v);
+            }
+        }
         return g >= 2;
     }
-
-    int gcd(int a, int b) {
-        return b == 0 ? a : gcd(b, a % b);
-    }
 };

solution/0900-0999/0914.X of a Kind in a Deck of Cards/Solution.go

@@ -1,17 +1,10 @@
 func hasGroupsSizeX(deck []int) bool {
-	counter := make([]int, 10000)
-	for _, d := range deck {
-		counter[d]++
-	}
-	var gcd func(a, b int) int
-	gcd = func(a, b int) int {
-		if b == 0 {
-			return a
-		}
-		return gcd(b, a%b)
+	cnt := make([]int, 10000)
+	for _, v := range deck {
+		cnt[v]++
 	}
 	g := -1
-	for _, v := range counter {
+	for _, v := range cnt {
 		if v > 0 {
 			if g == -1 {
 				g = v
@@ -21,4 +14,11 @@ func hasGroupsSizeX(deck []int) bool {
 		}
 	}
 	return g >= 2
+}
+
+func gcd(a, b int) int {
+	if b == 0 {
+		return a
+	}
+	return gcd(b, a%b)
 }

solution/0900-0999/0914.X of a Kind in a Deck of Cards/Solution.java

@@ -1,11 +1,11 @@
 class Solution {
     public boolean hasGroupsSizeX(int[] deck) {
-        int[] counter = new int[10000];
-        for (int d : deck) {
-            ++counter[d];
+        int[] cnt = new int[10000];
+        for (int v : deck) {
+            ++cnt[v];
         }
         int g = -1;
-        for (int v : counter) {
+        for (int v : cnt) {
             if (v > 0) {
                 g = g == -1 ? v : gcd(g, v);
             }