LeetCode Container With Most Water
来源:互联网 发布:顿巴纵队 知乎 编辑:程序博客网 时间:2024/05/19 06:38
Description:
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.
Solution:
In this problem, we first assume that the whole length can get the maximum square. And then we try to reduce the scope by making the smaller height[i]/height[j] bigger.
public class Solution {public int maxArea(int[] height) {int i = 0;int j = height.length - 1;int ans = 0;for (; i < j;) {ans = Math.max(ans, Math.min(height[i], height[j]) * (j - i));if (height[i] < height[j])i++;elsej--;}return ans;}}
e
0 0
- LeetCode: Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode Container With Most Water
- LeetCode: Container With Most Water
- [Leetcode] Container With Most Water
- Leetcode: Container With Most Water
- [LeetCode] Container With Most Water
- LeetCode Container With Most Water
- [Leetcode] Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode-Container With Most Water
- Container With Most Water leetcode
- LeetCode - Container With Most Water
- LeetCode: Container With Most Water
- Leetcode: Container With Most Water
- 【LeetCode】Container With Most Water
- Leetcode: Container With Most Water
- LeetCode:Container With Most Water
- MYSQL校对规则
- V4l2 capture时 USERPTR和MMAP的区别
- Oracle学习(9):创建和管理表
- C#泛型约束
- php连接oracle
- LeetCode Container With Most Water
- leetcode 8 string to integer(atoi)
- Spring IOC原理
- 如何在pl/sql工具中设置autoreplace.txt
- C++ 9.2迭代器支持的运算和迭代器范围
- oracle建存储过程
- HDU ACM 5246 超级赛亚ACMer 贪心
- 第十三周 项目一--动物这样叫(1)虚函数
- 字节笔记