Total Accepted: 8508 Total Submissions: 30322
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1]
, return 6
.
The above elevation map 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. Thanks Marcos for contributing this image!
public class Solution {
// left -> max , max <- right
public int trap(int[] A) {
if (A.length < 3) return 0;
int max = 0;
int last = 0;
int sum = 0;
for (int i = 0; i < A.length; i++) {
max = A[i] > A[max] ? i : max;
}
for (int i = 0; i <= max; i++) {
if (A[i] >= A[last]) last = i;
else sum += A[last] - A[i];
}
last = A.length - 1;
for (int i = A.length - 1; i >= max; i--) {
if (A[i] >= A[last]) last = i;
else sum += A[i] - A[last];
}
return sum;
}
}