leetcode---Container With Most Water

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 ans = 0;
int n = height.size();
int l = 0, r = n-1;
while(l < r)
{
ans = max(ans, min(height[l], height[r])*(r-l));
if(height[l] < height[r])
{
int k = l;
while(k<r && height[k] <= height[l])
k++;
l = k;
}
else
{
int k = r;
while(k>l && height[k] <= height[r])
k--;
r = k;
}
}
return ans;
}
};