Description
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2.
思路
- 使用两个指针，分别指向左右两端，然后从两端往中间移动，记录过程中最大的装水量。
- 每一次移动最小的那个边。
代码
- 时间复杂度：O(n)
class Solution {
public:
int maxArea(vector<int>& height) {
int res = 0;
int len = height.size();
if (len <= 1) return res;
int i = 0, j = len - 1;
while (i < j){
res = max(res, (j - i) * min(height[i], height[j]));
if (height[i] < height[j]) ++i;
else --j;
}
return res;
}
};内容来源于网络如有侵权请私信删除
- 还没有人评论，欢迎说说您的想法！
客服
