【C++】【leetcode200】岛屿数量(DFS、BFS)代码优化

岛屿数量
在这里插入图片描述

DFS

class Solution {
public:
    int n,m;
    void dfs(vector<vector<char>>& grid, vector<vector<int>>& visited,int i,int j) {
        if(i < 0 || i > m - 1 || j < 0 || j > n - 1 || grid[i][j] == '0')return;
        visited[i][j] = 1;
        if(i - 1 >= 0 && !visited[i - 1][j]) dfs(grid,visited,i - 1,j);
        if(i + 1 < m && !visited[i + 1][j])  dfs(grid,visited,i + 1,j);
        if(j - 1 >= 0 && !visited[i][j - 1]) dfs(grid,visited,i,j - 1);
        if(j + 1 < n && !visited[i][j + 1]) dfs(grid,visited,i,j + 1);
    }
    int numIslands(vector<vector<char>>& grid) {
        m = grid.size();
        n = grid[0].size();
        int ans = 0;
        vector<vector<int>> visited(m,vector<int>(n));

        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                if(grid[i][j] == '1' && !visited[i][j]){
                    ++ans;
                    dfs(grid,visited,i,j);
                }
            }
        }
        return ans;
    }
};

BFS

  • 不用定义访问数组,被访问过的直接把值改掉就好了
class Solution {
public:
    //BFS求解
    int numIslands(vector<vector<char>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        queue<pair<int,int>> q;
        int ans = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (grid[i][j] == '1') {
                    q.push({i,j});
                    grid[i][j] = '0';
                    while (!q.empty()) {
                        auto rc = q.front();
                        int row = rc.first, col = rc.second;
                        q.pop();
                        if (row+1 <= m-1 && grid[row+1][col] == '1' ){
                            grid[row+1][col] = '0';
                            q.push({row+1,col});
                        }
                        if (col+1 <= n-1 && grid[row][col + 1] == '1'){
                            grid[row][col+1] = '0';
                            q.push({row,col+1});
                        }
                        if (col-1 >= 0 && grid[row][col - 1] == '1' ){
                            grid[row][col-1] = '0';
                            q.push({row,col-1});
                        }
                        if (row-1 >= 0 && grid[row - 1][col ] == '1'){
                            grid[row-1][col] = '0';
                            q.push({row-1,col});
                        }
                    }
                    ++ans;
                }
            }
        }
        return ans;
    }
};

省份数量

代码改进

使用偏移量数组

class Solution {
public:
    int n,m;
    const int dr[4] = {-1,1,0,0};
    const int dc[4] = {0,0,-1,1};
    void dfs(vector<vector<char>>& grid,int r,int c){
        grid[r][c] = 'A';
        for(int i = 0;i < 4;++i){
            int rr = r + dr[i];
            int cc = c + dc[i];
            if(rr < 0 || cc < 0 || rr >= n || cc >= m || grid[rr][cc] != '1')continue;
            dfs(grid,rr,cc);
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        n = grid.size();
        m = grid[0].size();
        int ans = 0;
        for(int i = 0;i < n;++i){
            for(int j = 0;j < m;++j){
                if(grid[i][j] != '1')continue;
                dfs(grid,i,j);
                ++ans;
            }
        }
        return ans;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值