leetcode::pacific_atlantic_waterflow::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< vector< int > >	pacificAtlantic (vector< vector< int > > &heights)

详细描述

在文件 leetcode.h 第 2862 行定义.

成员函数说明

pacificAtlantic()

vector< vector< int > > leetcode::pacific_atlantic_waterflow::Solution::pacificAtlantic ( vector< vector< int > > &  heights )

static

在文件 leetcode.cpp 第 7896 行定义.

                                                                                  {
            const int m = heights.size();
            const int n = heights[0].size();
            unordered_set<pair<int, int>, myhash, myeq> pacific;
            unordered_set<pair<int, int>, myhash, myeq> atlantic;
            queue<pair<int, int>> q;
            vector<vector<int>> ans;
 
            for(int i = 0; i < m; i++) {
                q.push({i, 0});
                pacific.insert({i, 0});
            }
            for(int i = 1; i < n; i++) {
                q.push({0, i});
                pacific.insert({0, i});
            }
            while(!q.empty()) {
                auto [x, y] = q.front();
                q.pop();
                pair<int, int> nexts[4] = {{x + 1, y}, {x - 1, y}, {x, y + 1}, {x, y - 1}};
                for(auto &[next_x, next_y]: nexts) {
                    if(next_x >= 0 && next_y >= 0 && next_x < m && next_y < n && heights[next_x][next_y] >= heights[x][y] && !pacific.contains({next_x, next_y})) {
                        pacific.insert({next_x, next_y});
                        q.push({next_x, next_y});
                    }
                }
            }
 
            for(int i = 0; i < m; i++) {
                q.push({i, n - 1});
                atlantic.insert({i, n - 1});
            }
            for(int i = 0; i < n - 1; i++) {
                q.push({m - 1, i});
                atlantic.insert({m - 1, i});
            }
            while(!q.empty()) {
                auto [x, y] = q.front();
                q.pop();
                pair<int, int> nexts[4] = {{x + 1, y}, {x - 1, y}, {x, y + 1}, {x, y - 1}};
                for(auto &[next_x, next_y]: nexts) {
                    if(next_x >= 0 && next_y >= 0 && next_x < m && next_y < n && heights[next_x][next_y] >= heights[x][y] && !atlantic.contains({next_x, next_y})) {
                        atlantic.insert({next_x, next_y});
                        q.push({next_x, next_y});
                    }
                }
            }
 
            for(const auto &p: atlantic) {
                if(pacific.contains(p)) {
                    vector vec = {p.first, p.second};
                    ans.emplace_back(vec);
                }
            }
            sort(ans.begin(), ans.end());
            return ans;
        }

引用了 pat::a::a7_2::vec.

被这些函数引用 leetcode::pacific_atlantic_waterflow::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp