问题描述:
Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
Find the maximum area of an island in the given 2D array. (If there is no island, the maximum area is 0.)
Note: The length of each dimension in the given grid does not exceed 50.
利用深度优先搜索
代码:
class Solution {
public int maxAreaOfIsland(int[][] grid) {
int max = 0;
int[][] visited = new int[grid.length][grid[0].length];
if(grid == null || grid[0] == null) return 0;
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[i].length; j++){
if(visited[i][j] == 1)
continue;
int curMax = 0;
curMax = dfs(grid, visited, i, j);
if(curMax > max)
max = curMax;
}
}
return max;
}
public int dfs(int[][] grid, int[][] visited, int i, int j){
if(i < 0 || i >= grid.length || j < 0 || j >= grid[0].length)
return 0;
int num = 0;
if(grid[i][j] == 0 || visited[i][j] == 1)
return 0;
else{
visited[i][j] = 1;
num = 1 + dfs(grid, visited, i, j-1) + dfs(grid, visited, i, j+1) + dfs(grid,visited, i-1,j)+dfs(grid,visited,i+1,j);
}
return num;
}
}