Commit 87940c3

authored

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

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

1 parent e49a9f8 commit 87940c3Copy full SHA for 87940c3

File tree

+39

-2

lines changed

+39

-2

lines changed

Lines changed: 13 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -80,7 +80,19 @@`
`80`	`80`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`81`	`81`
`82`	`82`	```ts
`83`		`-`
	`83`	`+function minSwaps(nums: number[]): number {`
	`84`	`+ const n = nums.length;`
	`85`	`+ const m = nums.reduce((a, c) => a + c, 0);`
	`86`	`+ let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);`
	`87`	`+ let ans = cnt;`
	`88`	`+ for (let i = m; i < m + n; i++) {`
	`89`	`+ let prev = nums[i - m];`
	`90`	`+ let post = nums[i % n];`
	`91`	`+ cnt += (post - prev);`
	`92`	`+ ans = Math.max(cnt, ans);`
	`93`	`+ }`
	`94`	`+ return m - ans;`
	`95`	`+};`
`84`	`96`	```
`85`	`97`
`86`	`98`	`### ...`

Lines changed: 13 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -72,7 +72,19 @@ Thus, the minimum number of swaps required is 0.`
`72`	`72`	`### TypeScript`
`73`	`73`
`74`	`74`	```ts
`75`		`-`
	`75`	`+function minSwaps(nums: number[]): number {`
	`76`	`+ const n = nums.length;`
	`77`	`+ const m = nums.reduce((a, c) => a + c, 0);`
	`78`	`+ let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);`
	`79`	`+ let ans = cnt;`
	`80`	`+ for (let i = m; i < m + n; i++) {`
	`81`	`+ let prev = nums[i - m];`
	`82`	`+ let post = nums[i % n];`
	`83`	`+ cnt += (post - prev);`
	`84`	`+ ans = Math.max(cnt, ans);`
	`85`	`+ }`
	`86`	`+ return m - ans;`
	`87`	`+};`
`76`	`88`	```
`77`	`89`
`78`	`90`	`### ...`

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+function minSwaps(nums: number[]): number {`
	`2`	`+ const n = nums.length;`
	`3`	`+ const m = nums.reduce((a, c) => a + c, 0);`
	`4`	`+ let cnt = nums.reduce((a, c, i) => a + (i < m ? c : 0), 0);`
	`5`	`+ let ans = cnt;`
	`6`	`+ for (let i = m; i < m + n; i++) {`
	`7`	`+ let prev = nums[i - m];`
	`8`	`+ let post = nums[i % n];`
	`9`	`+ cnt += (post - prev);`
	`10`	`+ ans = Math.max(cnt, ans);`
	`11`	`+ }`
	`12`	`+ return m - ans;`
	`13`	`+};`

Comments

(0)