LeetCode 솔루션 분류

[8/31] 417. Pacific Atlantic Water Flow

컨텐츠 정보

본문

Medium
53061009Add to ListShare

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 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
Accepted
277,698
Submissions
524,220

관련자료

댓글 1

학부유학생님의 댓글

  • 익명
  • 작성일
Runtime: 306 ms, faster than 88.49% of Python3 online submissions for Pacific Atlantic Water Flow.
Memory Usage: 15.7 MB, less than 55.20% of Python3 online submissions for Pacific Atlantic Water Flow.
class Solution:
    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:
        ROW, COL = len(heights), len(heights[0])
        directions = [[1,0], [0,1], [-1,0], [0,-1]]
        result = []
        pacific, atlantic = set(), set()
        
        def dfs(row,col,reachable, prev_height):
            if (row, col) in reachable or row < 0 or col < 0 or row >= ROW or col >= COL or prev_height > heights[row][col]:
                return
            
            reachable.add((row,col))
            
            for row_dir, col_dir in directions:
                dfs(row+row_dir, col+col_dir, reachable, heights[row][col])
                
                
        for row in range(ROW):
            # pacific
            dfs(row, 0, pacific, heights[row][0])
            # atlantic
            dfs(row, COL-1, atlantic, heights[row][COL-1])
        
        for col in range(COL):
            #pacific
            dfs(0 , col, pacific, heights[0][col] )
            #atlantic
            dfs(ROW-1, col, atlantic, heights[ROW-1][col] )
        
        for r in range(ROW):
            for c in range(COL):
                if (r,c) in atlantic and (r,c) in pacific:
                    result.append([r,c])
        return result
LeetCode 솔루션 357 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 760 명
  • 오늘 방문자 5,073 명
  • 어제 방문자 6,932 명
  • 최대 방문자 14,831 명
  • 전체 회원수 1,481 명
알림 0