[LeetCode] Number of Islands

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:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3

寻找岛屿的个数。核心思想是利用一个visited二维数组来标志一个数(1)是否被访问过。在grid二维数组中局部使用广度优先遍历来判断并寻找岛屿。如果访问过则下次就不用将其再次计算。

class Solution {
public:
    int numIslands(vector<vector<char>>& grid) {
        if (grid.empty() || grid[0].empty())
            return 0;
        int cnt = 0;
        const int M = grid.size();
        const int N = grid[0].size();
        vector<vector<bool>> visited(M, vector<bool>(N, false));
        for (int i = 0; i != M; i++) {
            for (int j = 0; j != N; j++) {
                if (!visited[i][j] && grid[i][j] == '1') {
                    numIslandsCore(grid, visited, i, j);
                    cnt++;
                }
            }
        }
        return cnt;
    }
    
    void numIslandsCore(vector<vector<char>>& grid, vector<vector<bool>>& visited, int i, int j) {
        if (i >= 0 && i < grid.size() && j >= 0 && j < grid[0].size() && !visited[i][j] && grid[i][j] == '1') {
            visited[i][j] = true;
            numIslandsCore(grid, visited, i - 1, j);
            numIslandsCore(grid, visited, i, j - 1);
            numIslandsCore(grid, visited, i, j + 1);
            numIslandsCore(grid, visited, i + 1, j);
        }
    }
};
// 6 ms

 

转载于:https://www.cnblogs.com/immjc/p/7645106.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值