Commit ff2ee08

authored

feat: update ts solution to lcp problem: No.07 (doocs#2609)

1 parent b4112b7 commit ff2ee08Copy full SHA for ff2ee08

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -123,7 +123,7 @@ func numWays(n int, relation [][]int, k int) int {`
`123`	`123`
`124`	`124`	```ts
`125`	`125`	`function numWays(n: number, relation: number[][], k: number): number {`
`126`		`- const f: number[][] = newArray(k + 1).fill(0).map(() =>new Array(n).fill(0));`
	`126`	`+ const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(0));`
`127`	`127`	`f[0][0] = 1;`
`128`	`128`	`for (let i = 1; i <= k; ++i) {`
`129`	`129`	`for (const [a, b] of relation) {`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`function numWays(n: number, relation: number[][], k: number): number {`
`2`		`- const f: number[][] = newArray(k + 1).fill(0).map(() =>new Array(n).fill(0));`
	`2`	`+ const f: number[][] = Array.from({length: k + 1},() => Array(n).fill(0));`
`3`	`3`	`f[0][0] = 1;`
`4`	`4`	`for (let i = 1; i <= k; ++i) {`
`5`	`5`	`for (const [a, b] of relation) {`

Comments

(0)