feat: update ts solution to lc problem: No.0410

Author: rain84

solution/0400-0499/0410.Split Array Largest Sum/README.md

@@ -194,33 +194,30 @@ func splitArray(nums []int, k int) int {
 
 ```ts
 function splitArray(nums: number[], k: number): number {
-    let left = 0;
-    let right = 0;
-    for (const x of nums) {
-        left = Math.max(left, x);
-        right += x;
-    }
+    let l = Math.max(...nums);
+    let r = nums.reduce((a, b) => a + b);
+
     const check = (mx: number) => {
-        let s = 1 << 30;
-        let cnt = 0;
+        let [s, cnt] = [0, 0];
         for (const x of nums) {
             s += x;
             if (s > mx) {
                 s = x;
-                ++cnt;
+                if (++cnt === k) return false;
             }
         }
-        return cnt <= k;
+        return true;
     };
-    while (left < right) {
-        const mid = (left + right) >> 1;
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
         if (check(mid)) {
-            right = mid;
+            r = mid;
         } else {
-            left = mid + 1;
+            l = mid + 1;
         }
     }
-    return left;
+    return l;
 }
 ```
 

solution/0400-0499/0410.Split Array Largest Sum/README_EN.md

@@ -188,33 +188,30 @@ func splitArray(nums []int, k int) int {
 
 ```ts
 function splitArray(nums: number[], k: number): number {
-    let left = 0;
-    let right = 0;
-    for (const x of nums) {
-        left = Math.max(left, x);
-        right += x;
-    }
+    let l = Math.max(...nums);
+    let r = nums.reduce((a, b) => a + b);
+
     const check = (mx: number) => {
-        let s = 1 << 30;
-        let cnt = 0;
+        let [s, cnt] = [0, 0];
         for (const x of nums) {
             s += x;
             if (s > mx) {
                 s = x;
-                ++cnt;
+                if (++cnt === k) return false;
             }
         }
-        return cnt <= k;
+        return true;
     };
-    while (left < right) {
-        const mid = (left + right) >> 1;
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
         if (check(mid)) {
-            right = mid;
+            r = mid;
         } else {
-            left = mid + 1;
+            l = mid + 1;
         }
     }
-    return left;
+    return l;
 }
 ```
 

solution/0400-0499/0410.Split Array Largest Sum/Solution.ts

@@ -1,29 +1,26 @@
 function splitArray(nums: number[], k: number): number {
-    let left = 0;
-    let right = 0;
-    for (const x of nums) {
-        left = Math.max(left, x);
-        right += x;
-    }
+    let l = Math.max(...nums);
+    let r = nums.reduce((a, b) => a + b);
+
     const check = (mx: number) => {
-        let s = 1 << 30;
-        let cnt = 0;
+        let [s, cnt] = [0, 0];
         for (const x of nums) {
             s += x;
             if (s > mx) {
                 s = x;
-                ++cnt;
+                if (++cnt === k) return false;
             }
         }
-        return cnt <= k;
+        return true;
     };
-    while (left < right) {
-        const mid = (left + right) >> 1;
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
         if (check(mid)) {
-            right = mid;
+            r = mid;
         } else {
-            left = mid + 1;
+            l = mid + 1;
         }
     }
-    return left;
+    return l;
 }