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

Author: rain84

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

@@ -242,4 +242,40 @@ public class Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Prefix Sum
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+
+    const getMin = (x: 0 | 1) => {
+        const prefixSum = Array(n + 1).fill(0);
+        for (let i = 1; i <= n; i++) {
+            prefixSum[i] = prefixSum[i - 1] + (nums[i - 1] === x);
+        }
+
+        const length = prefixSum[n];
+        let ans = Number.POSITIVE_INFINITY;
+        for (let l = 0, r = length; r <= n; l++, r++) {
+            const min = length - (prefixSum[r] - prefixSum[l]);
+            ans = Math.min(ans, min);
+        }
+
+        return ans;
+    };
+
+    return Math.min(getMin(0), getMin(1));
+};
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -244,4 +244,40 @@ public class Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Prefix Sum
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+
+    const getMin = (x: 0 | 1) => {
+        const prefixSum = Array(n + 1).fill(0);
+        for (let i = 1; i <= n; i++) {
+            prefixSum[i] = prefixSum[i - 1] + (nums[i - 1] === x);
+        }
+
+        const length = prefixSum[n];
+        let ans = Number.POSITIVE_INFINITY;
+        for (let l = 0, r = length; r <= n; l++, r++) {
+            const min = length - (prefixSum[r] - prefixSum[l]);
+            ans = Math.min(ans, min);
+        }
+
+        return ans;
+    };
+
+    return Math.min(getMin(0), getMin(1));
+};
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,21 @@
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+
+    const getMin = (x: 0 | 1) => {
+        const prefixSum = Array(n + 1).fill(0);
+        for (let i = 1; i <= n; i++) {
+            prefixSum[i] = prefixSum[i - 1] + (nums[i - 1] === x);
+        }
+
+        const length = prefixSum[n];
+        let ans = Number.POSITIVE_INFINITY;
+        for (let l = 0, r = length; r <= n; l++, r++) {
+            const min = length - (prefixSum[r] - prefixSum[l]);
+            ans = Math.min(ans, min);
+        }
+
+        return ans;
+    };
+
+    return Math.min(getMin(0), getMin(1));
+}