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

Author: rain84

solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README.md

@@ -163,15 +163,17 @@ func minSwaps(nums []int) int {
 
 ```ts
 function minSwaps(nums: number[]): number {
-    const k = nums.reduce((a, b) => a + b, 0);
-    let cnt = nums.slice(0, k).reduce((a, b) => a + b, 0);
-    let mx = cnt;
     const n = nums.length;
-    for (let i = k; i < n + k; ++i) {
-        cnt += nums[i % n] - nums[(i - k + n) % n];
-        mx = Math.max(mx, cnt);
+    const k = nums.reduce((a, b) => a + b, 0);
+    let cnt = k - nums.slice(0, k).reduce((a, b) => a + b, 0);
+    let min = cnt;
+
+    for (let i = k; i < n + k; i++) {
+        cnt += nums[i - k] - nums[i % n];
+        min = Math.min(min, cnt);
     }
-    return k - mx;
+
+    return min;
 }
 ```
 

solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README_EN.md

@@ -165,15 +165,17 @@ func minSwaps(nums []int) int {
 
 ```ts
 function minSwaps(nums: number[]): number {
-    const k = nums.reduce((a, b) => a + b, 0);
-    let cnt = nums.slice(0, k).reduce((a, b) => a + b, 0);
-    let mx = cnt;
     const n = nums.length;
-    for (let i = k; i < n + k; ++i) {
-        cnt += nums[i % n] - nums[(i - k + n) % n];
-        mx = Math.max(mx, cnt);
+    const k = nums.reduce((a, b) => a + b, 0);
+    let cnt = k - nums.slice(0, k).reduce((a, b) => a + b, 0);
+    let min = cnt;
+
+    for (let i = k; i < n + k; i++) {
+        cnt += nums[i - k] - nums[i % n];
+        min = Math.min(min, cnt);
     }
-    return k - mx;
+
+    return min;
 }
 ```
 

solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/Solution.ts

@@ -1,11 +1,13 @@
 function minSwaps(nums: number[]): number {
-    const k = nums.reduce((a, b) => a + b, 0);
-    let cnt = nums.slice(0, k).reduce((a, b) => a + b, 0);
-    let mx = cnt;
     const n = nums.length;
-    for (let i = k; i < n + k; ++i) {
-        cnt += nums[i % n] - nums[(i - k + n) % n];
-        mx = Math.max(mx, cnt);
+    const k = nums.reduce((a, b) => a + b, 0);
+    let cnt = k - nums.slice(0, k).reduce((a, b) => a + b, 0);
+    let min = cnt;
+
+    for (let i = k; i < n + k; i++) {
+        cnt += nums[i - k] - nums[i % n];
+        min = Math.min(min, cnt);
     }
-    return k - mx;
+
+    return min;
 }