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

@@ -177,6 +177,24 @@ function minSwaps(nums: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minSwaps(nums) {
+    const n = nums.length;
+    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 min;
+}
+```
+
 #### Rust
 
 ```rust

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

@@ -179,6 +179,24 @@ function minSwaps(nums: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```ts
+function minSwaps(nums) {
+    const n = nums.length;
+    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 min;
+}
+```
+
 #### Rust
 
 ```rust

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

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