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.
/**
* Created by ustc-lezg on 16/4/6.
*/
public class Solution {
public int maxArea(int[] height) {
int left = 0;
int right = height.length - 1;
int maxarea = 0;
while (left < right) {
int area = (right - left) * (height[left] < height[right] ? height[left] : height[right]);
if (maxarea < area) {
maxarea = area;
}
if (height[left] < height[right]) {
++left;
} else {
--right;
}
}
return maxarea;
}
}