LeetCode--No.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

不知道为啥，这道题是我在leetcode里印象最深的一道题。
记得上次错，吭哧吭哧了好半天，交出来个错误答案。后来好像就放弃了。
这次的进步是，30秒送了个brute force竟然还没超时。果然o(n方)也不是不可忍受的存在啊。既然能brute force, 那就先来一下子嘛。
然后就看了答案。。哈哈哈哈。真的是对于array的奇形怪状的解法丧失了自己去琢磨的坚持。但是居然很make sense啊！！
所以拿到一道题，尤其是array, 如果想优化，就要想，哪些扫描是没必要的。就比如这道题，两个棍儿一个长，一个短，那么那成短的存在就没啥意义啊对不。睡觉！！

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