Container With Most Water
来源:互联网 发布:无线键盘软件下载 编辑:程序博客网 时间:2024/06/04 18:58
题目大意:给定一个数组,数组中每个元素表示高度,求形成的高度能够蓄的最大水的容量。
解题思路:双向指针
class Solution {public: int maxArea(vector<int> &height) { if(height.empty()) { return 0; } int left = 0, right = height.size() - 1; int maxArea = 0; while(left < right) { maxArea = max(maxArea, (right - left) * min(height[left], height[right])); if(height[left] < height[right]) { left++; } else { right--; } } return maxArea; }};
0 0
- Container With Most Water
- Container with most water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- java(24) - 内部类详解
- strcmp()字符串比较函数
- myeclipse10.0上装maven3插件
- UART接口
- 使用CoCos2dx-3.4开发一套可以商用的跑酷游戏 之二 视频演示
- Container With Most Water
- 简单排序集锦
- 欢迎使用CSDN-markdown编辑器
- 【BZOJ 2822】 [AHOI2012]树屋阶梯
- Piecewise Smooth Mumford-Shah Functional 使用方法
- 第2周项目类和对象--图书馆类
- PE文件的TLS-反调试机制
- Oracle迁移到MySQL总结
- HEVC