LeetCode 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 and n is at least 2.

 

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

 

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

题目链接：https://leetcode.com/problems/container-with-most-water/

题目分析：用一个公式来描述本题：i < j 求 max{ (j - i) * min(h[j], h[i]) }，对于确定的点i，j，答案取决于较小的那个高度值，然而我们希望这个较小值尽量大，因此对左右分别维护两个最大值，当前高度小于等于rMax时，向右遍历更新lMax，反之同理，遍历的同时更新答案，其实就是不断维护两个单调增的边界

正确性分析：假设当前边界pos为i和j，若存在k满足i < k < j且 k < min(h[i], h[j])，那么k不论与i还是j在一起都不可能使得答案更优

4ms，时间击败94.5%

class Solution {
    
    public int getWater(int[] height, int lPos, int rPos) {
        return (rPos - lPos) * Math.min(height[rPos], height[lPos]);
    }
    
    public int maxArea(int[] height) {
        int lPos = 0;
        int rPos = height.length - 1;
        int lMax = height[lPos];
        int rMax = height[rPos];
        int ans = getWater(height, lPos, rPos);
        while (lPos < rPos) {
            if (lMax <= rMax) {
                while (lPos <= rPos && height[lPos] <= rMax) {
                    ans = Math.max(ans, getWater(height, lPos++, rPos));
                }
                if (lPos < rPos) {
                    lMax = height[lPos];
                }
            } else {
                while (lPos <= rPos && height[rPos] <= lMax) {
                    ans = Math.max(ans, getWater(height, lPos, rPos--));
                }
                if (lPos < rPos) {
                    rMax = height[rPos];
                }
            }
            if (lPos < rPos) {
                ans = Math.max(ans, getWater(height, lPos, rPos));
            }
        }
        return ans;
    }
}

随手写的太烦了，简化代码：

class Solution {
    
    public int getWater(int[] height, int lPos, int rPos) {
        return (rPos - lPos) * Math.min(height[rPos], height[lPos]);
    }
    
    public int maxArea(int[] height) {
        int lPos = 0, rPos = height.length - 1;
        int ans = getWater(height, lPos, rPos);
        while (lPos < rPos) {
            if (height[lPos] < height[rPos]) {
                ans = Math.max(ans, getWater(height, lPos++, rPos));
            } else if (height[lPos] > height[rPos]) {
                ans = Math.max(ans, getWater(height, lPos, rPos--));
            } else {
                ans = Math.max(ans, getWater(height, lPos++, rPos--));
            }
        }
        return ans;
    }
}