leetCode-Container With Most Water-javascript

Container With Most Water

题目链接

题目描述：
给定n个非负整数 a1, a2, …, an , 每个数都代表坐标轴上一个点 (i, ai).n条垂直线在 (i, ai) 和(i, 0)之间. 找出两条线, 与x轴形成一个容器, 使得这个容器能装下最多水.
注意: 不会倾斜容器 并且n>=2.

样例输入：
输入: [1,8,6,2,5,4,8,3,7]
输出: 49

上面的条形图展示的是数组 [1,8,6,2,5,4,8,3,7]. 在这里, 这个容器能装的最大面积的水(蓝色部分) 是49.

算法思想：
The intuition behind this approach is that the area formed between the lines will always be limited by the height of the shorter line. Further, the farther the lines, the more will be the area obtained.
We take two pointers, one at the beginning and one at the end of the array constituting the length of the lines. Futher, we maintain a variable maxareamaxarea to store the maximum area obtained till now. At every step, we find out the area formed between them, update maxareamaxarea and move the pointer pointing to the shorter line towards the other end by one step.
How this approach works?
Initially we consider the area constituting the exterior most lines. Now, to maximize the area, we need to consider the area between the lines of larger lengths. If we try to move the pointer at the longer line inwards, we won’t gain any increase in area, since it is limited by the shorter line. But moving the shorter line’s pointer could turn out to be beneficial, as per the same argument, despite the reduction in the width. This is done since a relatively longer line obtained by moving the shorter line’s pointer might overcome the reduction in area caused by the width reduction.

function min(a,b){
     return a<b? a:b;
}

function sum(start,end,height){
    let minNum=min(height[start],height[end]);
    return minNum*(end-start);
}

var maxArea = function(height) {
    let Len=height.length;
    let contian=new Array(Len);
    let start=0,end=Len-1,MAX=0;
    while(start<end){
        let tmpS=sum(start,end,height);
        if(MAX<tmpS){ MAX=tmpS; }
        if(height[start]<height[end]){ start++;}
        else if(height[start]==height[end]){ 
            if(height[start+1]>height[end-1]){ start++;}
            else {end--;}
        }
        else { end--; }
    }
    return MAX;
};