LeetCode 11. Container With Most Water
来源:互联网 发布:mac ps如何导入字体 编辑:程序博客网 时间:2024/06/06 22:45
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 and n is at least 2.
求装最多水的容器的装水量。我们需要定义beg和end两个指针分别指向数组的左右两端,然后两个指针向中间搜索。由于容器装水量等于左右两个边中较小的边乘以两边相距的长度,那么指针向中间移动意味着边的距离变小,要得到更大的装水两就要求找到更高的容器。容器的高是由较短的边决定的,所以每次向内移动的边就是较短的那一边。
int maxArea(vector<int>& height) { int beg = 0, end = height.size() - 1; int maxArea = 0; while (beg != end) { int width = end - beg; int tempHeight = min(height[beg], height[end]); maxArea = max(maxArea, tempHeight*width); //找到下一个比较点 while (tempHeight >= height[beg] && beg != end) { ++beg; } while (tempHeight >= height[end] && beg != end) { --end; } } return maxArea; }
阅读全文
0 0
- LeetCode 11. Container With Most Water
- [LeetCode]11.Container With Most Water
- LeetCode --- 11. Container With Most Water
- LeetCode 11.Container With Most Water
- [Leetcode] 11. Container With Most Water
- [leetcode] 11.Container With Most Water
- 【leetcode】11. Container With Most Water
- [LeetCode]11. Container With Most Water
- 11. Container With Most Water LeetCode
- leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- [LeetCode OJ]11. Container With Most Water
- [leetcode] 11. Container With Most Water
- Leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- leetcode 11. Container With Most Water
- LeetCode 11. Container With Most Water
- LeetCode *** 11. Container With Most Water
- PHP MVC
- c/c++文件的基本操作
- cmd命令窗口导入导出MySQL
- J2SE总结
- C++ primer 第五版 第三章练习答案
- LeetCode 11. Container With Most Water
- [日常训练] tty的方程
- ORB_SLAM2系列之三:ORB_SLAM2跑RGBD SLAM数据集
- 判断元素出栈、入栈顺序的合法性
- 《ActiveMQ in Action》【PDF】
- JS中常用的Math方法
- 矩阵链相乘
- Jfinal HttpKit.post(url,data)源码解析
- Winform中报表RDLC的设计与实现