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.)
Example 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]]
Given the above grid, return 6
. Note the answer is not 11, because the island must be connected 4-directionally.
Example 2:
[[0,0,0,0,0,0,0,0]]
Given the above grid, return 0
.
Note: The length of each dimension in the given grid
does not exceed 50.
题目链接:https://leetcode.com/problems/max-area-of-island/
题目分析:DFS
2ms,时间击败100%
class Solution {
static int[] dx = new int[] {1, 0, -1, 0};
static int[] dy = new int[] {0, 1, 0, -1};
public int DFS(int x, int y, int n, int m, int[][] grid) {
int num = 1;
grid[x][y] = 0;
for (int i = 0; i < 4; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (xx >= 0 && xx < n && yy >= 0 && yy < m && grid[xx][yy] == 1) {
num += DFS(xx, yy, n, m, grid);
}
}
return num;
}
public int maxAreaOfIsland(int[][] grid) {
int n = grid.length;
if (n == 0) {
return 0;
}
int m = grid[0].length, ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 1) {
ans = Math.max(ans, DFS(i, j, n, m, grid));
}
}
}
return ans;
}
}