array的找规律的题
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
.
public class Solution {
public int trap(int[] A) {
int sum = 0;
int maxInd = -1;
int max = -1;
//find the highest bars;
for (int i = 0; i < A.length; i++) {
if (A[i] > max) {
max = A[i];
maxInd = i;
}
}
//loop through the left part from 0 to i-1
int pre = 0;
for (int i = 0; i < maxInd; i++) {
if (A[i] > pre){
sum += (A[i] - pre) * (maxInd - i);
pre = A[i];
}
sum -= A[i];
}
//loop through the right part from A.length to i+1
pre = 0;
for (int i = A.length-1; i > maxInd; i--) {
if (A[i] > pre) {
sum += (A[i] - pre) * (i - maxInd);
pre = A[i];
}
sum -= A[i];
}
return sum;
}
}