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

Author: rain84

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

@@ -274,6 +274,32 @@ function minSwaps(nums: number[]): number {
 };
 ```
 
+#### JavaScript
+
+```js
+function minSwaps(nums) {
+    const n = nums.length;
+
+    const getMin = x => {
+        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 -->

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

@@ -276,6 +276,32 @@ function minSwaps(nums: number[]): number {
 };
 ```
 
+#### JavaScript
+
+```js
+function minSwaps(nums) {
+    const n = nums.length;
+
+    const getMin = x => {
+        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 -->

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

@@ -0,0 +1,21 @@
+function minSwaps(nums) {
+    const n = nums.length;
+
+    const getMin = x => {
+        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));
+}