LeetCode417. Pacific Atlantic Water Flow

文章目录

一、题目

There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touches the island's left and top edges, and the Atlantic Ocean touches the island's right and bottom edges.

The island is partitioned into a grid of square cells. You are given an m x n integer matrix heights where heights[r][c] represents the height above sea level of the cell at coordinate (r, c).

The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is less than or equal to the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.

Return a 2D list of grid coordinates result where result[i] = [ri, ci] denotes that rain water can flow from cell (ri, ci) to both the Pacific and Atlantic oceans.

Example 1:

Input: heights = [[1,2,2,3,5],[3,2,3,4,4],[2,4,5,3,1],[6,7,1,4,5],[5,1,1,2,4]]

Output: [[0,4],[1,3],[1,4],[2,2],[3,0],[3,1],[4,0]]

Explanation: The following cells can flow to the Pacific and Atlantic oceans, as shown below:

0,4\]: \[0,4\] -\> Pacific Ocean \[0,4\] -\> Atlantic Ocean \[1,3\]: \[1,3\] -\> \[0,3\] -\> Pacific Ocean \[1,3\] -\> \[1,4\] -\> Atlantic Ocean \[1,4\]: \[1,4\] -\> \[1,3\] -\> \[0,3\] -\> Pacific Ocean \[1,4\] -\> Atlantic Ocean \[2,2\]: \[2,2\] -\> \[1,2\] -\> \[0,2\] -\> Pacific Ocean \[2,2\] -\> \[2,3\] -\> \[2,4\] -\> Atlantic Ocean \[3,0\]: \[3,0\] -\> Pacific Ocean \[3,0\] -\> \[4,0\] -\> Atlantic Ocean \[3,1\]: \[3,1\] -\> \[3,0\] -\> Pacific Ocean \[3,1\] -\> \[4,1\] -\> Atlantic Ocean \[4,0\]: \[4,0\] -\> Pacific Ocean \[4,0\] -\> Atlantic Ocean Note that there are other possible paths for these cells to flow to the Pacific and Atlantic oceans. Example 2: Input: heights = \[\[1\]

Output: [[0,0]]

Explanation: The water can flow from the only cell to the Pacific and Atlantic oceans.

Constraints:

m == heights.length

n == heights[r].length

1 <= m, n <= 200

0 <= heights[r][c] <= 105

二、题解

cpp 复制代码
class Solution {
public:
    int dirs[4][2] = {1,0,0,1,-1,0,0,-1};
    void dfs(vector<vector<int>>& heights,vector<vector<bool>>& visited,int x,int y){
        visited[x][y] = true;
        for(int i = 0;i < 4;i++){
            int nextX = x + dirs[i][0];
            int nextY = y + dirs[i][1];
            if(nextX < 0 || nextX >= heights.size() || nextY < 0 || nextY >= heights[0].size()) continue;
            if(heights[nextX][nextY] >= heights[x][y] && !visited[nextX][nextY]){
                dfs(heights,visited,nextX,nextY);
            }
        }
    }
    vector<vector<int>> pacificAtlantic(vector<vector<int>>& heights) {
        int m = heights.size(),n = heights[0].size();
        vector<vector<bool>> pacificVisited(m,vector<bool>(n,false));
        vector<vector<bool>> atlanticVisited(m,vector<bool>(n,false));
        //标记左右
        for(int i = 0;i < m;i++){
            dfs(heights,pacificVisited,i,0);
            dfs(heights,atlanticVisited,i,n-1);
        }
        //标记上下
        for(int j = 0;j < n;j++){
            dfs(heights,pacificVisited,0,j);
            dfs(heights,atlanticVisited,m-1,j);
        }
        vector<vector<int>> res;
        //统计结果
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                if(pacificVisited[i][j] && atlanticVisited[i][j]){
                    res.push_back({i,j});
                }
            }
        }
        return res;
    }
};
相关推荐
岁忧38 分钟前
(LeetCode 面试经典 150 题 ) 11. 盛最多水的容器 (贪心+双指针)
java·c++·算法·leetcode·面试·go
chao_78941 分钟前
二分查找篇——搜索旋转排序数组【LeetCode】两次二分查找
开发语言·数据结构·python·算法·leetcode
秋说3 小时前
【PTA数据结构 | C语言版】一元多项式求导
c语言·数据结构·算法
Maybyy3 小时前
力扣61.旋转链表
算法·leetcode·链表
谭林杰4 小时前
B树和B+树
数据结构·b树
卡卡卡卡罗特5 小时前
每日mysql
数据结构·算法
chao_7895 小时前
二分查找篇——搜索旋转排序数组【LeetCode】一次二分查找
数据结构·python·算法·leetcode·二分查找
蜉蝣之翼❉6 小时前
CRT 不同会导致 fopen 地址不同
c++·mfc
aramae6 小时前
C++ -- STL -- vector
开发语言·c++·笔记·后端·visual studio
lifallen6 小时前
Paimon 原子提交实现
java·大数据·数据结构·数据库·后端·算法