问题
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.
代码
class Solution {
public:
int maxArea(vector<int> &height) {
int i =0;
int j =1;
int len = height.size();
int maxArea = 0;
int tempsize = 0;
for (i = 0 ,j = len -1; i < len && j > i;) {
tempsize = (j-i) * min(height[i] , height[j]);
maxArea = max(tempsize , maxArea);
if(height[i] < height[j])
{
i++;
}
else
j--;
}
return maxArea;
}
};
分析
实际上,这题并没有太大的难度,只要证明:
取最左,和最有的height,则他们的水平跨度(w)最大,所以以两数中最小的height(h)作为高度,算出面积,两个指针往中间靠拢,因为靠拢会有损失:w会越来越小,所以必须拿h来补偿,所以只有碰到比当前 最小 height 要高,则移动左index,或者右index。
最后遍历一遍之后,时间复杂度是O(N),每次更新maxArea即可。return 之。
总结
和 2sum 原理类似。