feat: add typescript solution to lc problem: No.2134 (doocs#664)

No.2134.Minimum Swaps to Group All 1's Together II

Author: zhaocchen

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

@@ -80,7 +80,19 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```ts
-
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+    const m = nums.reduce((a, c) => a + c, 0);
+    let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);
+    let ans = cnt;
+    for (let i = m; i < m + n; i++) {
+        let prev = nums[i - m];
+        let post = nums[i % n];
+        cnt += (post - prev);
+        ans = Math.max(cnt, ans);
+    }
+    return m - ans;
+};
 ```
 
 ### **...**

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

@@ -72,7 +72,19 @@ Thus, the minimum number of swaps required is 0.
 ### **TypeScript**
 
 ```ts
-
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+    const m = nums.reduce((a, c) => a + c, 0);
+    let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);
+    let ans = cnt;
+    for (let i = m; i < m + n; i++) {
+        let prev = nums[i - m];
+        let post = nums[i % n];
+        cnt += (post - prev);
+        ans = Math.max(cnt, ans);
+    }
+    return m - ans;
+};
 ```
 
 ### **...**

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

@@ -0,0 +1,13 @@
+function minSwaps(nums: number[]): number {
+    const n = nums.length;
+    const m = nums.reduce((a, c) => a + c, 0);
+    let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);
+    let ans = cnt;
+    for (let i = m; i < m + n; i++) {
+        let prev = nums[i - m];
+        let post = nums[i % n];
+        cnt += (post - prev);
+        ans = Math.max(cnt, ans);
+    }
+    return m - ans;
+};