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.
ans = Math.max(ans, Math.min(height[left], height[right]) * (right - left));
not right - left + 1
because [1, 1] expect result is 1 not 2
it means 1 and 1 together makes a container |_|
class Solution {
public int maxArea(int[] height) {
if (height == null || height.length == 0) {
return 0;
}
int left = 0;
int right = height.length - 1;
int ans = 0;
while (left < right) {
ans = Math.max(ans, Math.min(height[left], height[right]) * (right - left));
if (height[left] < height[right]) {
left++;
}else {
right--;
}
}
return ans;
}
}