class Solution {
public:
int trap(vector<int>& height) {
int max=0;
int sum=0;
for(int i=0;i<height.size();i++)
{
if(height[i]>height[max])max=i;
}
for(int i=0,p=0;i<max;i++)
{
if(height[i]>p)p=height[i];
else sum+=p-height[i];
}
for(int i=height.size()-1,p=0;i>max;i--)
{
if(height[i]>p)p=height[i];
else sum+=p-height[i];
}
return sum;
}
};
接雨水最大面积Trapping Rain Water
最新推荐文章于 2024-09-25 21:49:38 发布