leetcode刷题. 岛屿问题的dfs解法. dfs算法复习

最新推荐文章于 2022-05-15 19:42:32 发布

paradox_1_0

最新推荐文章于 2022-05-15 19:42:32 发布

阅读量189

点赞数

分类专栏：【leetcode刷题】【算法】

本文链接：https://blog.csdn.net/paradox_1_0/article/details/105624133

版权

【算法】同时被 2 个专栏收录

114 篇文章 2 订阅

订阅专栏

【leetcode刷题】

95 篇文章 0 订阅

订阅专栏

vector<vector<int>> dirs{ {-1, 0}, {1, 0}, {0, -1}, {0,1} };

void island_dfs(vector<vector<int>>& g, int xlen, int ylen, pair<int, int> start) {

        int x = start.first;
        int y = start.second;

        g[x][y] = 0;

        for (int d = 0; d < 4; d++) {

                int ni = dirs[d][0] + x;
                int nj = dirs[d][1] + y;

                if (ni >= 0 && ni < xlen && nj >= 0 && nj < ylen && g[ni][nj])
                        island_dfs(g, xlen, ylen, pair<int, int>(ni, nj));
        }
}

int islandSum(vector<vector<int>>& g) {

        int count = 0;
        int xlen = g.size();
        int ylen = g[0].size();

        for (int i = 0; i < xlen; i++) {

                for (int j = 0; j < ylen; j++) {

                        if (g[i][j] == 1) {

                                island_dfs(g, xlen, ylen, pair<int, int>(i, j));
                                count++;
                        }
                }
        }
        return count;
}