11. 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,j分别指向数组的头和尾，如果height[i]<height[j]的话，如果height[k]<height[i] k++;

如果height[i]>height[j]的话，如果height[k]<height[j] j--;

代码如下(已通过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;

}

}