【LeetCode】Container With Most Water
来源:互联网 发布:kali和linux的关系 编辑:程序博客网 时间:2024/06/06 08:30
题目描述:
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.
O(n*n)的方法显而易见,但是会TLE,需要找O(n)的方法。解法:low初始为数组最左端(即为0),high初始为最右端(即size-1),然后往中间缩进。若 low<high 则low++,因为容器大小是由短板决定的,若low不变,容器只会小于等于之前的大小。low>=high时一样。
代码如下:
class Solution {public:int maxArea(vector<int> &height) {int area(0);int low(0), high(height.size() - 1);while (low < high){area = max(area, (high - low)*min(height[low], height[high]));if (height[low] < height[high])low++;elsehigh--;}return area;}};
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
- Android apk 签名测试问题
- spring四种依赖注入方式
- Android 异步加载图片,使用LruCache和SD卡或手机缓存,效果非常的流畅
- 代码简洁之道》读书笔记之四:边界、单元测试、类
- CSS浏览器兼容问题集(四)
- 【LeetCode】Container With Most Water
- Matlab sortrows函数
- 产品经理的核心四问
- 黑马程序员_享元模式
- ggplot2:Elegant Graphics for Data Analysis 阅读摘要(未完)
- cocos2d-x的声音控制
- jrtplib3.9.1 example3
- 《代码简洁之道》读书笔记之五:系统和迭进
- Android开源框架ImageLoader