【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.

左右指针往中间靠拢。

/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
    var i=0;
    var j=height.length-1;
    var left_flag;
    var right_flag;
    var m_area = 0;
    var left=height[i];
    var right = height[j];
    while(i!==j){
        if(left<right){
            var new_area = (j-i)*left;
            if(new_area>m_area){
                m_area = new_area;
                left_flag = i;
            }
            i++;
            left = height[i];
        }else{
            new_area = (j-i)*right;
            if(new_area>m_area){
                right_flag = j;
                m_area = new_area;
            }
            j--;
            right = height[j];
        }
    }
    return m_area;
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值