class Solution {
public:
int maxArea(vector<int>& height) {
int start = 0, end = height.size()-1, contain = 0;
int maxV = INT_MIN;
while (start < end) {
if(height[start] < height[end]){
contain = height[start] * (end-start);
maxV = max(maxV, contain);
start += 1;
}else{
contain = height[end] * (end-start);
maxV = max(maxV, contain);
end -= 1;
}
}
return maxV;
}
};
leetcode+11. Container With Most Water+双指针
最新推荐文章于 2024-07-18 08:26:33 发布