11. Container With Most Water 双指针问题
来源:互联网 发布:淘宝中年女装模特名字 编辑:程序博客网 时间:2024/06/03 19:18
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.
class Solution {public: int maxArea(vector<int>& height) { int water = 0; int i = 0, j = height.size() - 1; while (i < j) { int h = min(height[i], height[j]); water = max(water, (j - i) * h); while (height[i] <= h && i < j) i++; while (height[j] <= h && i < j) j--;//巧妙, 如果height[j] > height[i] 这句话不执行 } return water;}};
0 0
- 11. Container With Most Water 双指针问题
- leetcode 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
- 基于JSON数据HTML5视频播放器js插件
- Services和Activity之间进行数据交互
- angular2系统学习 - 路由与导航(4)
- Web MVC
- 【BLE】CC2541之多个自定义长短按键
- 11. Container With Most Water 双指针问题
- 获取treeWidget行信息
- 远方的路。。。。
- Java使用SOAP获取webservice实例解析
- 静态黑洞路由实例
- nginx的rewrite
- BarTender是如何做出雪花状文字
- 数据挖掘算法blog汇总
- Android Studio更新Gradle问题