feat: add solutions to lc problem: No.1984

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

Author: zhaocchen

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

@@ -81,6 +81,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumDifference(nums: number[], k: number): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = nums[n - 1] - nums[0];
+    for (let i = 0; i + k - 1 < n; i++) {
+        ans = Math.min(nums[i + k - 1] - nums[i], ans);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

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

@@ -71,6 +71,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumDifference(nums: number[], k: number): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = nums[n - 1] - nums[0];
+    for (let i = 0; i + k - 1 < n; i++) {
+        ans = Math.min(nums[i + k - 1] - nums[i], ans);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

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

@@ -0,0 +1,9 @@
+function minimumDifference(nums: number[], k: number): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = nums[n - 1] - nums[0];
+    for (let i = 0; i + k - 1 < n; i++) {
+        ans = Math.min(nums[i + k - 1] - nums[i], ans);
+    }
+    return ans;
+};