Commit 1ee0120

authored

feat: update ts solution to lc problem: No.1654 (doocs#1545)

1 parent f1585d4 commit 1ee0120Copy full SHA for 1ee0120

File tree

-9

lines changed

-9

lines changed

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -241,9 +241,7 @@ function minimumJumps(`
`241`	`241`	`const s: Set<number> = new Set(forbidden);`
`242`	`242`	`const q: [number, number][] = [[0, 1]];`
`243`	`243`	`const n = 6000;`
`244`		`- const vis: boolean[][] = Array(n)`
`245`		`- .fill(0)`
`246`		`- .map(() => Array(2).fill(false));`
	`244`	`+ const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);`
`247`	`245`	`vis[0][1] = true;`
`248`	`246`	`for (let ans = 0; q.length; ++ans) {`
`249`	`247`	`for (let t = q.length; t; --t) {`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -212,9 +212,7 @@ function minimumJumps(`
`212`	`212`	`const s: Set<number> = new Set(forbidden);`
`213`	`213`	`const q: [number, number][] = [[0, 1]];`
`214`	`214`	`const n = 6000;`
`215`		`- const vis: boolean[][] = Array(n)`
`216`		`- .fill(0)`
`217`		`- .map(() => Array(2).fill(false));`
	`215`	`+ const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);`
`218`	`216`	`vis[0][1] = true;`
`219`	`217`	`for (let ans = 0; q.length; ++ans) {`
`220`	`218`	`for (let t = q.length; t; --t) {`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,9 +7,7 @@ function minimumJumps(`
`7`	`7`	`const s: Set<number> = new Set(forbidden);`
`8`	`8`	`const q: [number, number][] = [[0, 1]];`
`9`	`9`	`const n = 6000;`
`10`		`- const vis: boolean[][] = Array(n)`
`11`		`- .fill(0)`
`12`		`- .map(() => Array(2).fill(false));`
	`10`	`+ const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);`
`13`	`11`	`vis[0][1] = true;`
`14`	`12`	`for (let ans = 0; q.length; ++ans) {`
`15`	`13`	`for (let t = q.length; t; --t) {`

Comments

(0)