feat: add solutions to lc problem: No.1984

No.1984.Minimum Difference Between Highest and Lowest of K Scores

Author: yanglbme

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/README.md

@@ -49,6 +49,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+排序。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -58,13 +60,8 @@
 ```python
 class Solution:
     def minimumDifference(self, nums: List[int], k: int) -> int:
-        if k == 1:
-            return 0
         nums.sort()
-        ans = maxsize
-        for i in range(len(nums) - k + 1):
-            ans = min(ans, nums[i + k - 1] - nums[i])
-        return ans
+        return min(nums[i + k - 1] - nums[i] for i in range(len(nums) - k + 1))
 ```
 
 ### **Java**
@@ -74,19 +71,50 @@ class Solution:
 ```java
 class Solution {
     public int minimumDifference(int[] nums, int k) {
-        if (k == 1) {
-            return 0;
-        }
         Arrays.sort(nums);
-        int min = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length - k + 1; i++) {
-            min = Math.min((nums[i + k - 1] - nums[i]), min);
+        int ans = 100000;
+        for (int i = 0; i < nums.length - k + 1; ++i) {
+            ans = Math.min(ans, nums[i + k - 1] - nums[i]);
         }
-        return min;
+        return ans;
     }
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumDifference(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        int ans = 1e5;
+        for (int i = 0; i < nums.size() - k + 1; ++i)
+            ans = min(ans, nums[i + k - 1] - nums[i]);
+        return ans;
+    }
+};
+```
+
+
+```go
+func minimumDifference(nums []int, k int) int {
+	sort.Ints(nums)
+	ans := 100000
+	for i := 0; i < len(nums)-k+1; i++ {
+		ans = min(ans, nums[i+k-1]-nums[i])
+	}
+	return ans
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/README_EN.md

@@ -52,30 +52,57 @@ The minimum possible difference is 2.</pre>
 ```python
 class Solution:
     def minimumDifference(self, nums: List[int], k: int) -> int:
-        if k == 1:
-            return 0
         nums.sort()
-        ans = maxsize
-        for i in range(len(nums) - k + 1):
-            ans = min(ans, nums[i + k - 1] - nums[i])
-        return ans
+        return min(nums[i + k - 1] - nums[i] for i in range(len(nums) - k + 1))
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public int minimumDifference(int[] nums, int k) {
-        if (k == 1) {
-            return 0;
-        }
         Arrays.sort(nums);
-        int min = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length - k + 1; i++) {
-            min = Math.min((nums[i + k - 1] - nums[i]), min);
+        int ans = 100000;
+        for (int i = 0; i < nums.length - k + 1; ++i) {
+            ans = Math.min(ans, nums[i + k - 1] - nums[i]);
         }
-        return min;
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minimumDifference(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        int ans = 1e5;
+        for (int i = 0; i < nums.size() - k + 1; ++i)
+            ans = min(ans, nums[i + k - 1] - nums[i]);
+        return ans;
     }
+};
+```
+
+### **Go**
+
+```go
+func minimumDifference(nums []int, k int) int {
+	sort.Ints(nums)
+	ans := 100000
+	for i := 0; i < len(nums)-k+1; i++ {
+		ans = min(ans, nums[i+k-1]-nums[i])
+	}
+	return ans
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
 }
 ```
 

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int minimumDifference(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        int ans = 1e5;
+        for (int i = 0; i < nums.size() - k + 1; ++i)
+            ans = min(ans, nums[i + k - 1] - nums[i]);
+        return ans;
+    }
+};

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/Solution.go

@@ -0,0 +1,15 @@
+func minimumDifference(nums []int, k int) int {
+	sort.Ints(nums)
+	ans := 100000
+	for i := 0; i < len(nums)-k+1; i++ {
+		ans = min(ans, nums[i+k-1]-nums[i])
+	}
+	return ans
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/Solution.java

@@ -1,13 +1,10 @@
 class Solution {
     public int minimumDifference(int[] nums, int k) {
-        if (k == 1) {
-            return 0;
-        }
         Arrays.sort(nums);
-        int min = Integer.MAX_VALUE;
-        for (int i = 0; i < nums.length - k + 1; i++) {
-            min = Math.min((nums[i + k - 1] - nums[i]), min);
+        int ans = 100000;
+        for (int i = 0; i < nums.length - k + 1; ++i) {
+            ans = Math.min(ans, nums[i + k - 1] - nums[i]);
         }
-        return min;
+        return ans;
     }
 }

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/Solution.py

@@ -1,9 +1,4 @@
 class Solution:
     def minimumDifference(self, nums: List[int], k: int) -> int:
-        if k == 1:
-            return 0
         nums.sort()
-        ans = maxsize
-        for i in range(len(nums) - k + 1):
-            ans = min(ans, nums[i + k - 1] - nums[i])
-        return ans
+        return min(nums[i + k - 1] - nums[i] for i in range(len(nums) - k + 1))