feat: add typescript solution to lc problem: No.2294

No.2294.Partition Array Such That Maximum Difference Is K

Author: zhaocchen

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md

@@ -157,7 +157,18 @@ func partitionArray(nums []int, k int) int {
 ### **TypeScript**
 
 ```ts
-
+function partitionArray(nums: number[], k: number): number {
+    if (!nums.length) return 0;
+    nums.sort((a, b) => a - b);
+    let ans = 1;
+    let prev = nums[0] + k;
+    for (let num of nums) {
+        if (num <= prev) continue;
+        prev = num + k;
+        ans++;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md

@@ -145,7 +145,18 @@ func partitionArray(nums []int, k int) int {
 ### **TypeScript**
 
 ```ts
-
+function partitionArray(nums: number[], k: number): number {
+    if (!nums.length) return 0;
+    nums.sort((a, b) => a - b);
+    let ans = 1;
+    let prev = nums[0] + k;
+    for (let num of nums) {
+        if (num <= prev) continue;
+        prev = num + k;
+        ans++;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.ts

@@ -0,0 +1,12 @@
+function partitionArray(nums: number[], k: number): number {
+    if (!nums.length) return 0;
+    nums.sort((a, b) => a - b);
+    let ans = 1;
+    let prev = nums[0] + k;
+    for (let num of nums) {
+        if (num <= prev) continue;
+        prev = num + k;
+        ans++;
+    }
+    return ans;
+};