https://leetcode.com/problems/trapping-rain-water/
논문이 읽기 싫을 때쯤 푸는 알고리즘
백준만 풀다가 리트코드로 넘어왔다.
Problem
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.
Level: Hard
Solving
곧 추가할 예정 ~ ~
𝑯𝒐𝒏𝒆𝒔𝒕𝒚 𝑰𝒏𝒕𝒆𝒈𝒓𝒊𝒕𝒚 𝑬𝒙𝒄𝒆𝒍𝒍𝒆𝒏𝒄𝒆