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.
https://leetcode.com/problems/container-with-most-water/

使用首尾两个指针，每次收缩高度较小的那个。因为如果收缩高度大的那端，无论收缩后高度变高还是变低，收缩后面积一定变小（因为收缩后宽度减1，高度不会大于高度小的那端）。

public int maxArea(int[] height) {
    if(height == null || height.length <= 1) return 0;
    int left = 0, right = height.length - 1, max = 0;
    while(left < right) {
        max = Math.max(max, (right - left) * Math.min(height[left], height[right]));
        if(height[left] < height[right])
            ++left;
        else
            --right;
    }
    return max;
}