200. Number of Islands

最新推荐文章于 2024-01-21 17:08:30 发布

万里归来少年心

最新推荐文章于 2024-01-21 17:08:30 发布

阅读量384

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签：岛屿的数量 Leetcode Number of Islands 搜索深度优先遍历

本文链接：https://blog.csdn.net/liyazhen2011/article/details/104061521

LeetCode 专栏收录该内容

85 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)遍历二维网格来计算岛屿数量的算法。该算法适用于由'1'(陆地)和'0'(水域)组成的地图，通过连接相邻的陆地形成岛屿。文章详细解释了如何实现DFS算法，并提供了具体的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Input:
11110
11010
11000
00000

Output: 1

Example 2:

Input:
11000
11000
00100
00011

Output: 3

解法：遍历 + 深度优先搜索。

class Solution {
public:
    int numIslands(vector<vector<char>>& grid)
    {
        if (grid.size() == 0 || grid[0].size()  == 0)
        {
            return 0;
        }
        int count = 0;
        for (int i = 0; i < grid.size(); i++)
        {
            for (int j = 0; j < grid[0].size(); j++)
            {
                if (grid[i][j] == '1')
                {
                    DFS(i,j,grid);
                    count++;
                }
            }
        }
        return count;
    }

     void DFS(int i, int j, vector<vector<char>>& grid)
    {    
        if (grid[i][j] == '1')
        {
            grid[i][j] = '0';
            for (int k = 0; k < 4; k++)
            {
                int newX = i + dx[k];
                int newY = j + dy[k];
                if (newX < grid.size() && newY < grid[0].size())
                {
                    DFS(newX, newY, grid);
                }              
            }
        }
    }
    
 private:   
     vector<int> dx = { -1,0,1,0 };
     vector<int> dy = { 0, 1,0,-1 }; 
};