For the best experience, increase the window size or view on a laptop or desktop device
Last updated: Pending
Title | ||
|---|---|---|
Loading... | ||
1/1
No questions are available yet
For the best experience, increase the window size or view on a laptop or desktop device
Title | ||
|---|---|---|
Loading... | ||
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.g
Example 1:
|
| *
| *---**-*
| *-**-******
––––––––––––––––
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: The above elevation map (denoted by *) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (denote by -) are being trapped.
Example 2:
Input: height = [4,2,0,3,2,5]
Output: 9
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.g
Example 1:
|
| *
| *---**-*
| *-**-******
––––––––––––––––
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: The above elevation map (denoted by *) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (denote by -) are being trapped.
Example 2:
Input: height = [4,2,0,3,2,5]
Output: 9
Output