Leetcode695. 岛屿的最大面积(C语言)
题目:
给定一个包含了一些 0 和 1的非空二维数组 grid , 一个 岛屿 是由四个方向 (水平或垂直) 的 1 (代表土地) 构成的组合。你可以假设二维矩阵的四个边缘都被水包围着。找到给定的二维数组中最大的岛屿面积。(如果没有岛屿,则返回面积为0。)例:
[[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’。
思路:
每一个为1的位置上下左右递归计数,每次检测面积是否最大;
为避免重复,将计数过的1改为0。
代码:
int CountArea(int** grid, int i, int j, int gridSize, int* gridColSize)
{
int count = 1;
grid[i][j] = 0;/*将扫描到的岛屿删除*/
if (i + 1 < gridSize && grid[i+1][j])
{
count += CountArea(grid, i + 1, j,gridSize, gridColSize);
}
if (i - 1 >= 0 && grid[i-1][j])
{
count += CountArea(grid, i - 1, j,gridSize, gridColSize);
}
if (j + 1 < gridColSize[i] && grid[i][j+1])
{
count += CountArea(grid, i, j + 1,gridSize, gridColSize);
}
if (j - 1 >= 0 && grid[i][j-1])
{
count += CountArea(grid, i, j - 1, gridSize, gridColSize);
}
return count;
}
int maxAreaOfIsland(int** grid, int gridSize, int* gridColSize)
{
int maxArea = 0;
int count = 0;
for (size_t i = 0; i <gridSize; i++)
{
for (size_t j = 0; j< gridColSize[i]; j++)
{
if (grid[i][j])/*发现“岛屿”*/
{
count= CountArea(grid, i, j, gridSize, gridColSize);
maxArea = maxArea > count ? maxArea : count;
}
}
}
return maxArea;
}