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.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:
Input: [1,8,6,2,5,4,8,3,7] Output: 49
代码:头尾两指针,然后height小的移动指针直到height变大继续更新
class Solution {
public:
int maxArea(vector<int>& height) {
int i=0,j=height.size()-1;
int ans=0;
while(i<j){
int h=min(height[i],height[j]);
ans=max(ans,h*(j-i));
while(i<j&&height[i]==h)i++;
while(i<j&&height[j]==h)j--;
}
return ans;
}
};