class Solution {
public:
int maxArea(vector<int>& height) {
int l = 0, r = height.size() - 1;
int ans = 0;
while (l < r) {
int area = min(height[l], height[r]) * (r - l);
ans = max(ans, area);
//左边高度小于右边
if (height[l] <= height[r]) {
++l;
}
//右边高度小于左边
else {
--r;
}
}
return ans;
}
};
11. 盛最多水的容器
最新推荐文章于 2024-09-12 13:19:42 发布