Commit f34e71c

committed

feat: add typescript solution to lc problem: No.2311

No.2311.Longest Binary Subsequence Less Than or Equal to K

1 parent 4b0b7f1 commit f34e71cCopy full SHA for f34e71c

File tree

+30

-2

lines changed

+30

-2

lines changed

Lines changed: 10 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -158,7 +158,16 @@ func longestSubsequence(s string, k int) int {`
`158`	`158`	`### TypeScript`
`159`	`159`
`160`	`160`	```ts
`161`		`-`
	`161`	`+function longestSubsequence(s: string, k: number): number {`
	`162`	`+ let numStr = '';`
	`163`	`+ const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);`
	`164`	`+ for (let i = n - 1; i >= 0; i--) {`
	`165`	`+ const cur = s.charAt(i).concat(numStr);`
	`166`	`+ if (parseInt(cur, 2) > k) break;`
	`167`	`+ numStr = cur;`
	`168`	`+ }`
	`169`	`+ return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);`
	`170`	`+};`
`162`	`171`	```
`163`	`172`
`164`	`173`	`### ...`

Lines changed: 10 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -144,7 +144,16 @@ func longestSubsequence(s string, k int) int {`
`144`	`144`	`### TypeScript`
`145`	`145`
`146`	`146`	```ts
`147`		`-`
	`147`	`+function longestSubsequence(s: string, k: number): number {`
	`148`	`+ let numStr = '';`
	`149`	`+ const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);`
	`150`	`+ for (let i = n - 1; i >= 0; i--) {`
	`151`	`+ const cur = s.charAt(i).concat(numStr);`
	`152`	`+ if (parseInt(cur, 2) > k) break;`
	`153`	`+ numStr = cur;`
	`154`	`+ }`
	`155`	`+ return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);`
	`156`	`+};`
`148`	`157`	```
`149`	`158`
`150`	`159`	`### ...`

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,10 @@`
	`1`	`+function longestSubsequence(s: string, k: number): number {`
	`2`	`+ let numStr = '';`
	`3`	`+ const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);`
	`4`	`+ for (let i = n - 1; i >= 0; i--) {`
	`5`	`+ const cur = s.charAt(i).concat(numStr);`
	`6`	`+ if (parseInt(cur, 2) > k) break;`
	`7`	`+ numStr = cur;`
	`8`	`+ }`
	`9`	`+ return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);`
	`10`	`+};`

Comments

(0)