Commit9ca185a

committed

fix: update

1 parentb2bf523 commit9ca185aCopy full SHA for 9ca185a

File tree

+37

-0

lines changed

+37

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+/**`
	`2`	`+ * 给你一个大小为 m x n 的二进制矩阵 grid 。`
	`3`	`+`
	`4`	`+岛屿是由一些相邻的 1 (代表土地) 构成的组合，这里的「相邻」要求两个 1 必须在水平或者竖直的四个方向上相邻。你可以假设 grid 的四个边缘都被 0（代表水）包围着。`
	`5`	`+`
	`6`	`+岛屿的面积是岛上值为 1 的单元格的数目。`
	`7`	`+`
	`8`	`+计算并返回 grid 中最大的岛屿面积。如果没有岛屿，则返回面积为 0 。`
	`9`	`+ */`
	`10`	`+/**`
	`11`	`+ * DFS 搜索`
	`12`	`+ *@param {number[][]} grid`
	`13`	`+ *@return {number}`
	`14`	`+ */`
	`15`	`+varmaxAreaOfIsland=function(grid){`
	`16`	`+letmax=0;`
	`17`	`+letrow=grid.length;`
	`18`	`+letcol=grid[0].length;`
	`19`	`+`
	`20`	`+functiondfs(grid,i,j){`
	`21`	`+// 递归终止条件`
	`22`	`+if(i<0\|\|i>=grid.length\|\|j<0\|\|j>=grid[0].length\|\|grid[i][j]===0){`
	`23`	`+return0;`
	`24`	`+}`
	`25`	`+grid[i][j]=0// 走过的标记为0`
	`26`	`+return1+dfs(grid,i+1,j)`
	`27`	`++dfs(grid,i,j+1)`
	`28`	`++dfs(grid,i-1,j)`
	`29`	`++dfs(grid,i,j-1)`
	`30`	`+}`
	`31`	`+for(leti=0;i<row;i++){`
	`32`	`+for(letj=0;j<col;j++){`
	`33`	`+max=Math.max(max,dfs(grid,i,j))`
	`34`	`+}`
	`35`	`+}`
	`36`	`+returnmax;`
	`37`	`+};`

Comments

(0)