feat: add solutions to lc problem: No.1984 (doocs#605)

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

Author: hongyiheng

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

@@ -57,15 +57,35 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```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
 ```
 
 ### **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);
+        }
+        return min;
+    }
+}
 ```
 
 ### **...**

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

@@ -51,13 +51,33 @@ The minimum possible difference is 2.</pre>
 ### **Python3**
 
 ```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
 ```
 
 ### **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);
+        }
+        return min;
+    }
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,13 @@
+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);
+        }
+        return min;
+    }
+}

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

@@ -0,0 +1,9 @@
+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