11. Container With Most Water

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.

//这题我一开始理解错了，我以为全部能存下多少水，其实是找出哪2个挡板可以存下最多水，并返回水容量。下面代码是一开始理解错的。

/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
    
    var len = height.length;
    
    var left = 0,max = 0,right = len - 1,total = 0;
    
    while(left < right){
        
        //比如 左边高度是 11  右边高度是 9， 根据短板原理，肯定 面积 = 9*底;
        
        //双指针的解法
        
        var min = Math.min(height[left],height[right]);
        
         if(min > max){
             
             total += (min-max) * (right - left);
             
             max = min;
             
         }
        
           height[left] > height[right] ? right-- : left++;
    }
    
    return total;
};

//正确代码
/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
    
    var len = height.length;
    
    var left = 0,max = 0,right = len - 1;
    
    while(left < right){
        
        //比如 左边高度是 11  右边高度是 9， 根据短板原理，肯定 面积 = 9*底;
        
        //双指针的解法
        
         max = Math.max(max,Math.min(height[left],height[right]) * (right - left));
        
    
         height[left] > height[right] ? right-- : left++;
    }
    
    return max;
};