(java)Container With Most Water

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.

思路：题意是找两个点（i,a[i]）,(j,a[j])使(j-i)*min(a[i],a[j])最大,可以使夹逼的方法,

如果height[i]<height[j],,从左往右找一个比height[i]小的height[k],i=k

如果height[i]>height[j] 从右往左找一个比height[j]大的height[k] j=k;

取res=max(res,(j-i)*min(height[i],height[j])),直到i=j为止，得到的就是最大的res

代码如下(已通过leetcode)

public class Solution {

public int maxArea(int[] height) {

int n = height.length;

int i = 0;

int j = n - 1;

int res = 0;

while (i < j) {

res = Math.max(res, Math.min(height[i], height[j]) * (j - i));

if (height[i] < height[j]) {

int k = i;

while (k < j && height[k] <= height[i])

k++;

i = k;

} else {

int k = j;

while (k > i && height[k] <= height[j])

k--;

j = k;

}

}

return res;

}

}