题目:
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.
Example:
Input: [1,8,6,2,5,4,8,3,7] Output: 49
暴力搜索法:Time Exceeded limited O(n^2)
class Solution {
public:
int maxArea(vector<int>& height) {
int mArea = 0;
for(int i = 0; i < height.size();i++)
{
for(int j= i + 1; j < height.size();j++)
{
int Area = min(height[i],height[j]) * (j - i);
mArea = max(mArea,Area);
}
}
return mArea;
}
};
方法二:双指针法 two pointer O(n)
接下来看看双指针是怎么工作的
How this approach works?
Initially we consider the area constituting the exterior most lines. Now, to maximize the area, we need to consider the area between the lines of larger lengths. If we try to move the pointer at the longer line inwards, we won't gain any increase in area, since it is limited by the shorter line. But moving the shorter line's pointer could turn out to be beneficial, as per the same argument, despite the reduction in the width. This is done since a relatively longer line obtained by moving the shorter line's pointer might overcome the reduction in area caused by the width reduction. 最开始,两个指针组成的区域里,包含所有的lines,为了扩大蓄水面积,我们需要考虑使两端的lines的高度比较高,如果我们试图移动指向较高line的指针,向内侧,蓄水面积并不会增加,因为面积受限于较低的line,但是移动较低的指针可能会,尽管同时宽度会减少; 当增加的高度大于宽度的减少时,面积会增加。
class Solution {
public:
int maxArea(vector<int>& height) {
int low = 0;
int high = height.size() - 1;
int mArea = 0;
while(low < high)
{
int Area = min(height[low],height[high]) * (high - low);
mArea = max(mArea,Area);
if(height[low] < height[high])
low++;
else
high--;
}
return mArea;
}
};