2020년/코테
[파이썬 알고리즘 인터뷰] 빗물 트래핑
github.com/onlybooks/algorithm-interview 아.. 이거 너무 어렵단 42. Trapping Rain Water 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: 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 ..
2020. 12. 20. 18:53