给定 n 个非负整数表示每个宽度为 1 的柱子的高度图,计算按此排列的柱子,下雨之后能接多少雨水。
上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图,在这种情况下,可以接 6 个单位的雨水(蓝色部分表示雨水)。 感谢 Marcos 贡献此图。
示例:
输入: [0,1,0,2,1,0,1,3,2,1,2,1]
输出: 6
===========================================
解题思路:说来很巧,我在一次面试的时候,问了我相同的算法题
当时我的思考了3分钟,给了一个思路,虽然不是最快的,但效率还不错,因此通过了面试
我当时最差时间复杂度是O(2n),代码如下
public int trap(int[] height) {
if (height.length<3) return 0;
int prep = 0;
int res = 0;
int temp = 0;
int max = height[0];
for (int i = 0; i < height.length; i++) {
if (height[i]<=max){
temp+=max-height[i];
}else {
res+=temp;
temp=0;
prep = i;
max = height[i];
}
}
if (temp==0) return res;
max=height[height.length-1];
temp=0;
for (int i = height.length-1; i > prep-1; i--) {
if (height[i]<=max){
temp+=max-height[i];
}else {
res+=temp;
temp=0;
max = height[i];
}
}
return res;
}
Find the maximum of the array from left to right . At the same time, calculate the maximum water storage on the left side.
After traversing the array , Go backwards to where the maximum is, and do the same calculation.
Later I saw this in LeetCode , I decided to solve this problem in a similar way to Binary Search .In this way, we can get the
result only through one traversal.
希望我以后看我自己博客可以看的懂....
下面是代码
public int trap(int[] height) {
int len = height.length;
if (len<3)return 0;
int res=0,l=0,r=len-1,lmax=height[0],rmax=height[len-1];
while (l<r)
if (lmax<rmax){
int temp = height[++l];
if(temp<lmax) res+=lmax-temp;
else lmax=temp;
}else {
int temp = height[--r];
if(temp<rmax) res+=rmax-temp;
else rmax=temp;
}
return res;
}