11. Container With Most Water(js)
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
题意:计算直方图中任意两边围成矩形的面积,返回最大值
代码如下(js):
var maxArea = function(height) { var len=height.length; var max=0; var left=0,right=len-1; while(left<right){ // 找出左右两边较矮的高,计算面积和当前最大值进行比较 max=max>(right-left)*Math.min(height[left],height[right])?max:(right-left)*Math.min(height[left],height[right]); // 比较左右两边的高,较矮的向中间挪一步 height[left]>height[right]?right--:left++; } return max; };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步