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
Solution:
class HackerHeap {
public int maxArea(int[] height) {
int start=0;
int end=height.length-1;
int max=0;
for(int k=0;k<height.length-1;k++) {
int res=0;
int length=end-start;
if(height[start]<height[end]) {
res=height[start]*length;
start++;
}
else {
res=height[end]*length;
end--;
}
max=Math.max(max, res);
}
return max;
}
}