https://leetcode-cn.com/problems/pacific-atlantic-water-flow/submissions/
class Solution {
public:
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
vector<vector<int>> pacificAtlantic(vector<vector<int>>& matrix) {
vector<vector<int>> ret;
int m = matrix.size();
if(m == 0) return ret;
int n = matrix[0].size();
vector<vector<int>> reach1(m, vector<int>(n)), reach2(m, vector<int>(n));
queue<pair<int, int>> que1, que2;
for(int i = 0; i < m; i++)
{
reach1[i][0] = 1;
que1.push({i, 0});
reach2[i][n - 1] = 1;
que2.push({i, n - 1});
}
for(int j = 0; j < n; j++)
{
reach1[0][j] = 1;
que1.push({0, j});
reach2[m - 1][j] = 1;
que2.push({m - 1, j});
}
while(!que1.empty())
{
auto pr = que1.front(); que1.pop();
int x = pr.first, y = pr.second;
for(int i = 0; i < 4; i++)
{
int nx = x + dx[i];
int ny = y + dy[i];
if(nx >= 0 && nx < m && ny >= 0 && ny < n && matrix[nx][ny] >= matrix[x][y] && reach1[nx][ny] == 0)
{
reach1[nx][ny] = 1;
que1.push({nx, ny});
}
}
}
while(!que2.empty())
{
auto pr = que2.front(); que2.pop();
int x = pr.first, y = pr.second;
for(int i = 0; i < 4; i++)
{
int nx = x + dx[i];
int ny = y + dy[i];
if(nx >= 0 && nx < m && ny >= 0 && ny < n && matrix[nx][ny] >= matrix[x][y] && reach2[nx][ny] == 0)
{
reach2[nx][ny] = 1;
que2.push({nx, ny});
}
}
}
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(reach1[i][j] && reach2[i][j]) ret.push_back({i, j});
}
}
return ret;
}
};
这道题相当于说水能从边界流向周围大于等于它的点。所以有两个边界。计算这两个边界能流到哪些点。求两部分的并集就可以。