Container With Most Water
来源:互联网 发布:软件定制开发报价方案 编辑:程序博客网 时间:2024/06/06 05:08
题目
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.
思路
该问题可在
在计算区域面积时,我们以min(height[i], height[j])作为高,假如height[i] < height[j],因为对于任意的j,min(height[i], height[j])所能返回的最大值为height[i],所以我们可以忽略line i与区间[i,j]内其他line组成的区域的计算;同理当height[i] > height[j]时,可以忽略line j与区间[i,j]内其他line组成的区域
代码
public class Solution { public int maxArea(int[] height) { int i = 0, j = height.length-1, area = 0; while(i < j){ area = Math.max(area, (j-i) * Math.min(height[i], height[j])); if(height[i] < height[j]) i++; else j--; } return area; }}
0 0
- Container With Most Water
- Container with most water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- 使用NFS文件系统与嵌入式设备传输文件
- 将FreeRTOS-Plus-CLI项目加入工程使用歩骤1
- codevs1215走迷宫
- Ubuntu14.04安装PyCharm
- Web页面优化
- Container With Most Water
- Lotto
- js学习三:操作属性的方法
- 继承BaseAdapter实现Filterable的adapter类完整示例
- Pascal's Triangle II
- 智慧环境
- 九度oj 1335
- C - Valera and Contest题解
- apk文件反编译工具apktool的下载,安装,使用