Coding Round 2
Senior
programming
LeetCode #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. The question involves calculating the volume of water that can be stored between the bars based on the height difference.Example 1:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: Water trapped = 1 + 4 + 1 = 6Example 2:
Input: height = [4,2,0,3,2,5]
Output: 9
Explanation: Water trapped = 4 + 1 + 4 = 9Constraints:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: Water trapped = 1 + 4 + 1 = 6Example 2:
Input: height = [4,2,0,3,2,5]
Output: 9
Explanation: Water trapped = 4 + 1 + 4 = 9Constraints:
- n == height.length
- 1 <= n <= 2 * 10^4
- 0 <= height[i] <= 10^5
Suggested Answer