给你一个大小为 m x n 的二进制矩阵 grid 。
岛屿 是由一些相邻的 1 (代表土地) 构成的组合,这里的「相邻」要求两个 1 必须在 水平或者竖直的四个方向上 相邻。你可以假设 grid 的四个边缘都被 0(代表水)包围着。
岛屿的面积是岛上值为 1 的单元格的数目。
计算并返回 grid 中最大的岛屿面积。如果没有岛屿,则返回面积为 0 。
示例 1:
图1 岛屿的最大面积示例图
输入:grid = [[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]]
输出:6
解释:答案不应该是 11 ,因为岛屿只能包含水平或垂直这四个方向上的 1 。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/max-area-of-island
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解一、迭代解法,终止条件,索引最大最小越界,以及数组元素为0,返回0,不为0,记数,并且本元素置0,以防回溯时重复添加,上下左右继续遍历。
class Solution{
public int maxAreaOfIsland(int[][] grid){
int res = 0;
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[0].length; j++){
res = Math.max(res,dfs(grid,i,j));
}
}
return res;
}
public int dfs(int[][] grid, int i, int j){
if(i < 0 || i == grid.length || j < 0 || j == grid[0].length || grid[i][j] == 0){
return 0;
}
int ans = 1;
grid[i][j] = 0;
int[] di = {1, 0, 0, -1};
int[] dj = {0, -1, 1, 0};
for(int m = 0; m < 4; m++){
int nexti = i + di[m];
int nextj = j + dj[m];
ans += dfs(grid,nexti,nextj);
}
return ans;
}
}
题解二、DFS+栈,将坐标分解,存储至两个栈内,根据栈是否为空,进行一次深度遍历,弹出后进行索引越界和0的判断,进行记数部分内容。
class Solution{
public int maxAreaOfIsland(int[][] grid){
int ans = 0;
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[0].length; j++){
int cur = 0;
Deque<Integer> stacki = new LinkedList<>();
Deque<Integer> stackj = new LinkedList<>();
stacki.push(i);
stackj.push(j);
while(!stacki.isEmpty()){
int curi = stacki.pop();
int curj = stackj.pop();
if(curi < 0 || curi == grid.length || curj < 0 || curj == grid[0].length || grid[curi][curj] == 0){
continue;
}
cur++;
grid[curi][curj] = 0;
int[] di = {1, 0, 0, -1};
int[] dj = {0, 1, -1, 0};
for(int n = 0; n < 4; n++){
int nexti = curi + di[n];
int nextj = curj + dj[n];
stacki.push(nexti);
stackj.push(nextj);
}
}
ans = Math.max(ans,cur);
}
}
return ans;
}
}
题解三、BFS,使用队列存储元素,进行遍历。
class Solution{
public int maxAreaOfIsland(int[][] grid){
int ans = 0;
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[0].length; j++){
int cur = 0;
Queue<Integer> qi = new LinkedList<>();
Queue<Integer> qj = new LinkedList<>();
qi.offer(i);
qj.offer(j);
while(!qi.isEmpty()){
int curi = qi.poll();
int curj = qj.poll();
if(curi < 0 || curi == grid.length || curj < 0 || curj == grid[0].length || grid[curi][curj] == 0){
continue;
}
cur++;
grid[curi][curj] = 0;
int[] di = {1, 0, 0, -1};
int[] dj = {0, -1, 1, 0};
for(int m = 0; m < 4; m++){
int nexti = curi + di[m];
int nextj = curj + dj[m];
qi.offer(nexti);
qj.offer(nextj);
}
}
ans = Math.max(ans,cur);
}
}
return ans;
}
}