11. Container With Most Water
来源:互联网 发布:去除录音噪音软件 编辑:程序博客网 时间:2024/05/29 16:55
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.
思路:设置两个指针i,j分别指向数组的头和尾,如果height[i]<height[j]的话,如果height[k]<height[i] k++;
如果height[i]>height[j]的话,如果height[k]<height[j] j--;
代码如下(已通过leetcode)
public class Solution {
public int maxArea(int[] height) {
int n = height.length;
int i = 0;
int j = n - 1;
int res = 0;
while (i < j) {
res = Math.max(res, Math.min(height[i], height[j]) * (j - i));
if (height[i] < height[j]) {
int k = i;
while (k < j && height[k] <= height[i])
k++;
i = k;
} else {
int k = j;
while (k > i && height[k] <= height[j])
k--;
j = k;
}
}
return res;
}
}
- 11.Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11.Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 正则表达式 - 语法
- 计划管理
- python中 “按位与,或,异或”与C语言的不同(转载自红黑联盟)
- 【UNET自学日志】Part6 更有效率的旋转同步
- 数据对齐详解
- 11. Container With Most Water
- 关于一笔画问题的简单解答ACM中的题(1)
- iOS开发系列--音频播放、录音、视频播放、拍照、视频录制
- 56.EasyLikeArea
- 版本管理
- 数据库 safe You are using safe update mode and you tried to update a table without a WHERE
- canvas 制作时钟效果
- [LintCode] 用递归打印数字 Print Numbers by Recursion
- RabbitMQ (四) 路由选择 (Routing)