feat: add solutions to lc problem: No.1979

1979.Find Greatest Common Divisor of Array

Author: yanglbme

solution/1900-1999/1979.Find Greatest Common Divisor of Array/README.md

@@ -51,27 +51,107 @@ nums 中最大的数是 3
 	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+最大公约数算法：
+
+```java
+int gcd(int a, int b) {
+	return b > 0 ? gcd(b, a % b) : a;
+}
+```
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def findGCD(self, nums: List[int]) -> int:
+        def gcd(a, b):
+            return gcd(b, a % b) if b > 0 else a
 
+        return gcd(max(nums), min(nums))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int findGCD(int[] nums) {
+        int a = 1, b = 1000;
+        for (int num : nums) {
+            a = Math.max(a, num);
+            b = Math.min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findGCD(vector<int>& nums) {
+        int a = 0, b = 1000;
+        for (int num : nums)
+        {
+            a = max(a, num);
+            b = min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findGCD(nums []int) int {
+	a, b := 0, 1000
+	for _, num := range nums {
+		a = max(a, num)
+		b = min(b, num)
+	}
+	return gcd(a, b)
+}
+
+func gcd(a, b int) int {
+	if b > 0 {
+		return gcd(b, a%b)
+	}
+	return a
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1900-1999/1979.Find Greatest Common Divisor of Array/README_EN.md

@@ -58,13 +58,86 @@ The greatest common divisor of 3 and 3 is 3.
 ### **Python3**
 
 ```python
+class Solution:
+    def findGCD(self, nums: List[int]) -> int:
+        def gcd(a, b):
+            return gcd(b, a % b) if b > 0 else a
 
+        return gcd(max(nums), min(nums))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int findGCD(int[] nums) {
+        int a = 1, b = 1000;
+        for (int num : nums) {
+            a = Math.max(a, num);
+            b = Math.min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findGCD(vector<int>& nums) {
+        int a = 0, b = 1000;
+        for (int num : nums)
+        {
+            a = max(a, num);
+            b = min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findGCD(nums []int) int {
+	a, b := 0, 1000
+	for _, num := range nums {
+		a = max(a, num)
+		b = min(b, num)
+	}
+	return gcd(a, b)
+}
+
+func gcd(a, b int) int {
+	if b > 0 {
+		return gcd(b, a%b)
+	}
+	return a
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1900-1999/1979.Find Greatest Common Divisor of Array/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int findGCD(vector<int>& nums) {
+        int a = 0, b = 1000;
+        for (int num : nums)
+        {
+            a = max(a, num);
+            b = min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+};

solution/1900-1999/1979.Find Greatest Common Divisor of Array/Solution.go

@@ -0,0 +1,29 @@
+func findGCD(nums []int) int {
+	a, b := 0, 1000
+	for _, num := range nums {
+		a = max(a, num)
+		b = min(b, num)
+	}
+	return gcd(a, b)
+}
+
+func gcd(a, b int) int {
+	if b > 0 {
+		return gcd(b, a%b)
+	}
+	return a
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

solution/1900-1999/1979.Find Greatest Common Divisor of Array/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int findGCD(int[] nums) {
+        int a = 1, b = 1000;
+        for (int num : nums) {
+            a = Math.max(a, num);
+            b = Math.min(b, num);
+        }
+        return gcd(a, b);
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+}

solution/1900-1999/1979.Find Greatest Common Divisor of Array/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def findGCD(self, nums: List[int]) -> int:
+        def gcd(a, b):
+            return gcd(b, a % b) if b > 0 else a
+
+        return gcd(max(nums), min(nums))