LeetCode-11 Container With Most Water(容器装水最大量)

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.

两边开始向中间逼近，判断当前蓄水量（短板决定高度）是否需要更新。

优化的话，每次逼近时先判断新位置的高度是否高于外侧的高度，否则就直接跳过判断。

public class Solution {
    public int maxArea(int[] height) {
    	int temp = 0;
    	int max = 0;
        int left  = 0;
        int right = height.length - 1;
        while (right > left) {
        	if (height[left] > height[right] ) {
        		max = max > height[right]*(right-left) ? max:height[right]*(right-left);//判断max是否需要更新
        		temp = height[right];
				do {
					right--;优化：向中间靠拢，高度却没有更大，就直接pass掉。
				} while (temp > height[right] && right > left);
			}else {
				max = max > height[left]*(right-left) ? max:height[left]*(right-left);
				temp = height[left];
				do {
					left++;
				} while (temp > height[left] && right > left);
			}
		}
        return max;
    }
}

Run Time：420 ms

好像比别人慢一些，

去网上找了很多代码也差不多都是这样的方法，不解。