继续慢慢推grind75==
42. 陷阱水
虽然是hard可是感觉蛮简单ㄉ==
老题目比较单纯
正反各扫一遍
一开始没想到最高的可能会一样高
加个maxH记起来 还能剪枝
class Solution {
public:
int trap(vector<int>& height) {
int maxH = 0;
int currH = 0;
int saved = 0, saving = 0;
for(int h: height){
if(currH <= h){
currH = h;
saved += saving;
saving = 0;
}
else{
saving += (currH - h);
}
}
if(saving == 0){
return saved;
}
maxH = currH;
currH = 0;
saving = 0;
for(int j = height.size()-1; j >= 0; j