feat: add 2nd ts solution to lc problem: No.2294

Author: rain84

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

@@ -177,4 +177,30 @@ function partitionArray(nums: number[], k: number): number {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function partitionArray(nums: number[], k: number): number {
+    let c = 0;
+
+    while (nums.length) {
+        const max = Math.max(...nums) - k;
+        nums = nums.filter(x => x < max);
+        c++;
+    }
+
+    return c;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -171,4 +171,30 @@ function partitionArray(nums: number[], k: number): number {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function partitionArray(nums: number[], k: number): number {
+    let c = 0;
+
+    while (nums.length) {
+        const max = Math.max(...nums) - k;
+        nums = nums.filter(x => x < max);
+        c++;
+    }
+
+    return c;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,11 @@
+function partitionArray(nums: number[], k: number): number {
+    let c = 0;
+
+    while (nums.length) {
+        const max = Math.max(...nums) - k;
+        nums = nums.filter(x => x < max);
+        c++;
+    }
+
+    return c;
+}