695. Max Area of Island Difficulty: Easy

最新推荐文章于 2019-04-08 09:33:00 发布

原创最新推荐文章于 2019-04-08 09:33:00 发布 · 351 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#LeetCode

LeetCode 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)策略寻找二维数组中最大岛屿面积的方法。通过遍历每个岛屿并标记已访问区域，确保了算法的有效性和准确性。

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.

算法分析：利用深度优先搜索的策略，把每一个岛看成是一个连通图，那么问题就是找一个最大的连通图，即节点最多的。只不过这里不需要建立visited数组来防止重复遍历一个节点，只要把经过的节点的值置为0。

C语言版

void dfs(int** grid, int gridRowSize, int gridColSize, int* count, int row, int col)
{
    grid[row][col] = 0;
    (*count)++;
    if(row + 1 < gridRowSize && grid[row + 1][col] == 1)
        dfs(grid, gridRowSize, gridColSize, count, row + 1, col);
    if(row - 1>= 0 && grid[row - 1][col] == 1)
        dfs(grid, gridRowSize, gridColSize, count, row - 1, col);
    if(col - 1 >= 0 && grid[row][col - 1] == 1)
        dfs(grid, gridRowSize, gridColSize, count, row, col - 1);
    if(col + 1 < gridColSize && grid[row][col + 1] == 1)
        dfs(grid, gridRowSize, gridColSize, count, row, col + 1);
}

int maxAreaOfIsland(int** grid, int gridRowSize, int gridColSize) {
    int i, j, max_island = 0;
    for(i = 0; i < gridRowSize; i++)
    {
        for(j = 0; j < gridColSize; j++)
        {
            if(grid[i][j] == 1)
            {
                int count = 0;
                dfs(grid, gridRowSize, gridColSize, &count, i, j);
                if(count > max_island)
                    max_island = count;
            }
        }
    }
    return max_island;
}

Python版

def maxAreaOfIsland(self, grid):
    m, n = len(grid), len(grid[0])

    def dfs(i, j):
        if 0 <= i < m and 0 <= j < n and grid[i][j]:
            grid[i][j] = 0
            return 1 + dfs(i - 1, j) + dfs(i, j + 1) + dfs(i + 1, j) + dfs(i, j - 1)
        return 0

    areas = [dfs(i, j) for i in range(m) for j in range(n) if grid[i][j]]
    return max(areas) if areas else 0