11. Container With Most Water
来源:互联网 发布:最后的幸存者小说知临 编辑:程序博客网 时间:2024/06/04 18:41
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.
hint 两根指针
code
public class ContainerWithMostWater { public int maxArea(int[] height) { if (height == null || height.length < 2) { return 0; } int max = 0, left = 0; int right = height.length - 1; while (left < right) { max = Math.max(max, (right - left) * (Math.min(height[left], height[right]))); if (height[left] < height[right]) { left++; } else { right--; } } return max; }}
0 0
- 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
- Android开发优化之——对Bitmap的内存优化
- LeetCode 35 - Search Insert Position
- iOS传值方法
- nginx做负载均衡时的session问题解决办法jvm-route原理
- 若有以下定义,且0<=i<4,则不正确的赋值语句是 int b[4][6],*p,*q[4]; A q[i]=b[i]; B p=b; C p=b[i]; D q[i]=&b[0][0];
- 11. Container With Most Water
- HDOJ 1715 大菲波数
- 为什么我要选择使用Yarn来做Docker的调度引擎
- Atitit.linq java的原理与实现 解释器模式
- Application Transport Security has blocked a cleartext HTTP (http://) resource load since it is inse
- [MTK6574] 移植odin问题总结
- 如何使用js实现电影海报画廊特效?
- Android Studio中Junit单元测试使用JSON对象异常的问题
- HDU 2612