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.

var maxArea = function(height) {
    let left = 0;
    let right = height.length-1;
    let max = 0;
    while(right>left) {
        let area = (right-left) * Math.min(height[left],height[right]);
        max = Math.max(area,max);
        if(height[left]>height[right]) {
            right--;
        }
        else if(height[left]<height[right]) {
            left++;
        }
        else {
            right--;
            left++;
        }
    }
    return max;
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值