给定一个包含了一些 0 和 1的非空二维数组 grid , 一个 岛屿 是由四个方向 (水平或垂直) 的 1 (代表土地) 构成的组合。你可以假设二维矩阵的四个边缘都被水包围着。
找到给定的二维数组中最大的岛屿面积。(如果没有岛屿,则返回面积为0。)
示例 1:
[[0,0,1,0,0,0,0,1,0,0,0,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,1,1,0,1,0,0,0,0,0,0,0,0],
[0,1,0,0,1,1,0,0,1,0,1,0,0],
[0,1,0,0,1,1,0,0,1,1,1,0,0],
[0,0,0,0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,0,0,0,0,0,0,1,1,0,0,0,0]]
思路
(1)一道经典的题。用深搜和广搜皆可。
(2)扩展:
LeetCode-DFS-200-M:岛屿数量(Number of Islands)
LeetCode-DFS&BFS-130-M:被围绕的区域(Surrounded Regions)
LeetCode-3.4-994-E-腐烂的橘子(Rotting Oranges)
LeetCode-Array&Backtracking -79-M:单词搜索(Word Search)
剑指Offer面试题12:矩阵中的路径
解法1-深搜
class Solution {
int row = 0, col = 0, area = 0;
public int maxAreaOfIsland(int[][] grid) {
row = grid.length;
col = grid[0].length;
for(int i = 0; i < row; i++){
for(int j = 0; j < col; j++){
if(grid[i][j] == 1){
int s = dfs(grid, i, j);
if(s > area){
area = s;
}
}
}
}
return area;
}
private int dfs(int[][] grid, int i, int j){
if(i < 0 || i >= row || j < 0 || j >=col || grid[i][j] == 0){
return 0;
}
grid[i][j] = 0;
return dfs(grid, i+1, j) +
dfs(grid, i-1, j ) +
dfs(grid, i, j+1) +
dfs(grid, i, j-1) +1;
}
}
解法1-2
(1)没通过,问题在于count这个形参只会在当前层值改变,而上一层递归的count值在上一层就已经分配好了。
private int dfs2(int[][] grid, int i, int j, int count){
if(i < 0 || i >= row || j < 0 || j >=col || grid[i][j] == 0){
return 0;
}
grid[i][j] = 0;
count++;
dfs2(grid, i+1, j, count);
dfs2(grid, i-1, j ,count);
dfs2(grid, i, j+1, count);
dfs2(grid, i, j-1, count);
return count;
}