LeetCode图 200. 岛屿数量

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

示例 1：

输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例 2：

输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

#include <bits/stdc++.h>



using namespace std;



class Solution {

public:

    void dfs(vector<vector<char>>&grid,int i,int j)

    {

        if(!judgement(grid,i,j)) return;

        if(grid[i][j] == '1')//确定是岛屿且没被遍历过

        { 

            grid[i][j] = 2;

            dfs(grid,i-1,j);

            dfs(grid,i+1,j);

            dfs(grid,i,j-1);

            dfs(grid,i,j+1);

        }

    }

    bool judgement(vector<vector<char>>&grid,int i,int j)//判断是否越界

    {

        int n = grid.size();

        int m = grid[0].size();

        if(i>=n||j>=m) return false;

        else if(i<0||j<0) return false;

        else return true;

    }

    int numIslands(vector<vector<char>>& grid) {

        int ans = 0;

        int n = grid.size();

        int m = grid[0].size();

        for(int i = 0;i<n;++i)

        {

            for(int j = 0;j<m;++j)

            {

                if(grid[i][j] == '1')

                {

                    ans++;

                    dfs(grid,i,j);

                }

            }

        }

        return ans;

    }

};

int main(){

    

    Solution solution;

    

    // 创建一个二维字符向量，模拟网格

    std::vector<std::vector<char>> grid = {

        {'1', '1', '0', '0', '0'},

        {'1', '1', '0', '0', '0'},

        {'0', '0', '1', '0', '0'},

        {'0', '0', '0', '1', '1'}

    };

    

    

    int n = solution.numIslands(grid);

    

    // 输出结果

    std::cout << "Number of islands: " << n<< std::endl;

    

    return 0;

}