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.
public class Solution {
public int maxArea(int[] height) {
int start=0;
int end=height.length-1;
int maxWater=(height[start]>height[end]?height[end]:height[start])*(end-start);
int curMax;
while(start<end)
{
if(height[start]>=height[end])
{
end--;
curMax=(height[start]>height[end]?height[end]:height[start])*(end-start);
if(curMax>maxWater)
{
maxWater=curMax;
}
}
else if(height[start]<height[end])
{
start++;
curMax=(height[start]>height[end]?height[end]:height[start])*(end-start);
if(curMax>maxWater)
{
maxWater=curMax;
}
}
}
return maxWater;
}
}