LeetCode 11. Container With Most Water(java)

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.

解法：关键思想在于，假设nums[left]大于等于nums[right]，那么以nums[left]为左边的container是最大的了，不会再出现其他以nums[left]为左边的更大的container，因此，我们可以left++，来找以下一个为左边的可能的答案；那么假设nums[left]小于等于nums[right]，那么以nums[right]为右边的container就是最大的了，因此right–，来找以下一个为右边的可能的答案；

public int maxArea(int[] height) {
        if (height.length <= 1) return 0;
        int begin = 0, end = height.length - 1, max = 0;
        while (begin < end) {
            int area = Math.min(height[begin], height[end]) * (end - begin);
            if (area > max) max = area;
            if (height[begin] > height[end]) {
                end--;
            //这里这样写的原因是：当左边大于等于右边，那么不会再有一个subarray,以左边为左边；当右边大于等于左边，那么不会有一个subarray,以右边当右边，所以我们end--,begin++即可。
            } else if (height[begin] == height[end]) {
                begin++;
                end--;
            } else {
                begin++;
            }
        }
        return max;
    }