Leetcode—417. 太平洋大西洋水流问题【中等】

2025每日刷题（229）

Leetcode—417. 太平洋大西洋水流问题

实现代码

class Solution {
public:
    vector<vector<int>> pacificAtlantic(vector<vector<int>>& heights) {
        const int m = heights.size();
        const int n = heights[0].size();

        vector<vector<int>> ans;

        vector<vector<bool>> seenP(m, vector<bool>(n));
        vector<vector<bool>> seenA(m, vector<bool>(n));

        function<void(int, int, vector<vector<bool>>&, int)> dfs = [&](int i, int j, vector<vector<bool>>& seen, int h = 0) {
            if(i < 0 || i == m || j < 0 || j == n) {
                return;
            }

            // “水往高处流”
            if(seen[i][j] || heights[i][j] < h) {
                return;
            }

            seen[i][j] = true;
            dfs(i, j + 1, seen, heights[i][j]);
            dfs(i + 1, j, seen, heights[i][j]);
            dfs(i, j - 1, seen, heights[i][j]);
            dfs(i - 1, j, seen, heights[i][j]);
        };

        for(int i = 0; i < m; ++i) {
            dfs(i, 0, seenP, 0);
            dfs(i, n - 1, seenA, 0);
        }

        for(int j = 0; j < n; ++j) {
            dfs(0, j, seenP, 0);
            dfs(m - 1, j, seenA, 0);
        }

        for(int i = 0; i < m; ++i) {
            for(int j = 0; j < n; ++j) {
                if(seenP[i][j] && seenA[i][j]) {
                    ans.push_back({i, j});
                }
            }
        }
        return ans;
    }
};

运行结果

之后我会持续更新，如果喜欢我的文章，请记得一键三连哦，点赞关注收藏，你的每一个赞每一份关注每一次收藏都将是我前进路上的无限动力 ！！！↖(▔▽▔)↗感谢支持！