엔지니어 게시판
LeetCode 솔루션 분류

[9/18] 42. Trapping Rain Water

작성자 정보

  • 학부유학생 작성
  • 작성일

컨텐츠 정보

본문

42. Trapping Rain Water
Hard
22787305Add to ListShare

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

 

Example 1:

rainwatertrap.png
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.

Example 2:

Input: height = [4,2,0,3,2,5]
Output: 9

 

Constraints:

  • n == height.length
  • 1 <= n <= 2 * 104
  • 0 <= height[i] <= 105
Accepted
1,329,016
Submissions
2,271,134

관련자료

댓글 1

학부유학생님의 댓글

  • 학부유학생
  • 작성일
Runtime: 207 ms, faster than 54.49% of Python3 online submissions for Trapping Rain Water.
Memory Usage: 16 MB, less than 44.49% of Python3 online submissions for Trapping Rain Water.
class Solution:
    def trap(self, height: List[int]) -> int:
        l, r = 0, len(height)-1
        
        water = 0
        lmax = rmax = 0
        
        while l <= r:
            lmax, rmax = max(height[l],lmax), max(height[r],rmax)
            if lmax >= rmax:
                
                water += rmax - height[r]
                r -= 1
            else:
                water += lmax - height[l]
                l+=1
        
        return water
전체 240 / 1 페이지
게시글 쓰기
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 77 명
  • 오늘 방문자 766 명
  • 어제 방문자 1,117 명
  • 최대 방문자 1,463 명
  • 전체 회원수 378 명
알림 0