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.
找出给定序列中min(nums[i], nums[j])*(j-i)的最大值。
public class Solution {
public int maxArea(int[] height) {
int left = 0;
int right = height.length - 1;
int cap = 0;
while (left < right) {
int tmp = Math.min(height[left], height[right]) * (right - left);
if (tmp > cap) cap = tmp;
if (height[left] > height[right]) {
right--;
} else {
left++;
}
}
return cap;
}
}