题目:
解答:
使用两次遍历,记录从1->i的maxheight值,如果有低于的,则差值存入temp中,如果当前height大于maxheight,则将temp值存入sum中,因为此时可以确认之前temp的保留值会留存下来。然后反向遍历一次,完成。
代码:
class Solution {
public:
int trap(vector<int>& A) {
int n = A.size();
int temp = 0,sum = 0,premax = 0;
int flag = 0;
for( int i = 0;i < n;++i ) {
if( A[i] >= premax ) {
premax = A[i];
sum += temp;
temp = 0;
}
else
temp += premax - A[i];
}
premax = 0;
temp = 0;
for( int i = n - 1;i >= 0;--i ) {
if( A[i] > premax ) {
premax = A[i];
sum += temp;
temp = 0;
}
else
temp += premax - A[i];
}
return sum;
}
};
更新会同步在我的网站更新(https://zergzerg.cn/notes/webnotes/leetcode/index.html)