Commit 282001a

authored

refactor: update typescript solution to lc problem: No.200 (doocs#2884)

1 parent ba88122 commit 282001aCopy full SHA for 282001a

File tree

+30

-33

lines changed

+30

-33

lines changed

Lines changed: 10 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -208,20 +208,19 @@ function numIslands(grid: string[][]): number {`
`208`	`208`	`const m = grid.length;`
`209`	`209`	`const n = grid[0].length;`
`210`	`210`	`let ans = 0;`
`211`		`- function dfs(i, j) {`
`212`		`- grid[i][j] = '0';`
`213`		`- const dirs = [-1, 0, 1, 0, -1];`
`214`		`- for (let k = 0; k < 4; ++k) {`
`215`		`- const x = i + dirs[k];`
`216`		`- const y = j + dirs[k + 1];`
`217`		`- if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1') {`
`218`		`- dfs(x, y);`
`219`		`- }`
	`211`	`+ const dfs = (i: number, j: number) => {`
	`212`	`+ if (grid[i]?.[j] !== '1') {`
	`213`	`+ return;`
`220`	`214`	`}`
`221`		`- }`
	`215`	`+ grid[i][j] = '0';`
	`216`	`+ dfs(i + 1, j);`
	`217`	`+ dfs(i - 1, j);`
	`218`	`+ dfs(i, j + 1);`
	`219`	`+ dfs(i, j - 1);`
	`220`	`+ };`
`222`	`221`	`for (let i = 0; i < m; ++i) {`
`223`	`222`	`for (let j = 0; j < n; ++j) {`
`224`		`- if (grid[i][j] == '1') {`
	`223`	`+ if (grid[i][j] === '1') {`
`225`	`224`	`dfs(i, j);`
`226`	`225`	`++ans;`
`227`	`226`	`}`

Lines changed: 10 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -198,20 +198,19 @@ function numIslands(grid: string[][]): number {`
`198`	`198`	`const m = grid.length;`
`199`	`199`	`const n = grid[0].length;`
`200`	`200`	`let ans = 0;`
`201`		`- function dfs(i, j) {`
`202`		`- grid[i][j] = '0';`
`203`		`- const dirs = [-1, 0, 1, 0, -1];`
`204`		`- for (let k = 0; k < 4; ++k) {`
`205`		`- const x = i + dirs[k];`
`206`		`- const y = j + dirs[k + 1];`
`207`		`- if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1') {`
`208`		`- dfs(x, y);`
`209`		`- }`
	`201`	`+ const dfs = (i: number, j: number) => {`
	`202`	`+ if (grid[i]?.[j] !== '1') {`
	`203`	`+ return;`
`210`	`204`	`}`
`211`		`- }`
	`205`	`+ grid[i][j] = '0';`
	`206`	`+ dfs(i + 1, j);`
	`207`	`+ dfs(i - 1, j);`
	`208`	`+ dfs(i, j + 1);`
	`209`	`+ dfs(i, j - 1);`
	`210`	`+ };`
`212`	`211`	`for (let i = 0; i < m; ++i) {`
`213`	`212`	`for (let j = 0; j < n; ++j) {`
`214`		`- if (grid[i][j] == '1') {`
	`213`	`+ if (grid[i][j] === '1') {`
`215`	`214`	`dfs(i, j);`
`216`	`215`	`++ans;`
`217`	`216`	`}`

Lines changed: 10 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,20 +2,19 @@ function numIslands(grid: string[][]): number {`
`2`	`2`	`const m = grid.length;`
`3`	`3`	`const n = grid[0].length;`
`4`	`4`	`let ans = 0;`
`5`		`- function dfs(i, j) {`
`6`		`- grid[i][j] = '0';`
`7`		`- const dirs = [-1, 0, 1, 0, -1];`
`8`		`- for (let k = 0; k < 4; ++k) {`
`9`		`- const x = i + dirs[k];`
`10`		`- const y = j + dirs[k + 1];`
`11`		`- if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1') {`
`12`		`- dfs(x, y);`
`13`		`- }`
	`5`	`+ const dfs = (i: number, j: number) => {`
	`6`	`+ if (grid[i]?.[j] !== '1') {`
	`7`	`+ return;`
`14`	`8`	`}`
`15`		`- }`
	`9`	`+ grid[i][j] = '0';`
	`10`	`+ dfs(i + 1, j);`
	`11`	`+ dfs(i - 1, j);`
	`12`	`+ dfs(i, j + 1);`
	`13`	`+ dfs(i, j - 1);`
	`14`	`+ };`
`16`	`15`	`for (let i = 0; i < m; ++i) {`
`17`	`16`	`for (let j = 0; j < n; ++j) {`
`18`		`- if (grid[i][j] == '1') {`
	`17`	`+ if (grid[i][j] === '1') {`
`19`	`18`	`dfs(i, j);`
`20`	`19`	`++ans;`
`21`	`20`	`}`

Comments

(0)