200. 岛屿数量

最新推荐文章于 2024-09-18 19:42:42 发布

不叫芫荽

最新推荐文章于 2024-09-18 19:42:42 发布

阅读量73

点赞数

分类专栏： LeetCode刷题

本文链接：https://blog.csdn.net/CRJ297486/article/details/116355461

版权

LeetCode刷题专栏收录该内容

94 篇文章 1 订阅

订阅专栏

给你一个由 ‘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

提示：

m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 '0' 或 '1'

1.dfs

class Solution {
public:
    void dfs(int i,int j,vector<vector<char>>& grid,int m,int n){
            grid[i][j]='0';
            //上边
            if(i&&grid[i-1][j]=='1'){
                dfs(i-1,j,grid,m,n);
            }
            //左边
            if(j&&grid[i][j-1]=='1'){
                dfs(i,j-1,grid,m,n);
            }
            //下边
            if(i+1<m&&grid[i+1][j]=='1'){
                dfs(i+1,j,grid,m,n);
            }
            //右边
            if(j+1<n&&grid[i][j+1]=='1'){
                dfs(i,j+1,grid,m,n);
            }
    }



    int numIslands(vector<vector<char>>& grid) {
        int m=grid.size();
        int n=grid[0].size();
        int cnt=0;
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
            
                if(grid[i][j]=='1'){
                    cout<<i<<" "<<j<<endl;
                    dfs(i,j,grid,m,n);
                    cnt++;
                }
            }
        }
        return cnt;

    }
};

2.bfs

class Solution {
public:

    int numIslands(vector<vector<char>>& grid) {
        int m=grid.size();
        int n=grid[0].size();
        int cnt=0;
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(grid[i][j]=='1'){
                    grid[i][j]='0';
                    queue<int>q1;
                    queue<int>q2;
                    q1.push(i);
                    q2.push(j);
                    int r;
                    int c;
                    while(q1.size()){
                        cout<<"cee";
                        r=q1.front();
                        q1.pop();
                        c=q2.front();
                        q2.pop();
                        //上边
                        if(r&&grid[r-1][c]=='1'){
                            q1.push(r-1);
                            q2.push(c);
                            grid[r-1][c]='0';
                        }
                        //左边
                        if(c&&grid[r][c-1]=='1'){
                            q1.push(r);
                            q2.push(c-1);
                            grid[r][c-1]='0';
                        }
                        //下边
                        if(r+1<m&&grid[r+1][c]=='1'){
                            q1.push(r+1);
                            q2.push(c);
                            grid[r+1][c]='0';
                        }
                        //右边
                        if(c+1<n&&grid[r][c+1]=='1'){
                            q1.push(r);
                            q2.push(c+1);
                            grid[r][c+1]='0';
                        }
                    }
                    cnt++;

                }
            
                
                
            }
        }
        return cnt;

    }
};