数组 Container With Most Water
来源:互联网 发布:中国进口数据分析 编辑:程序博客网 时间:2024/05/22 11:59
思想:
start初始指向0,end指向size-1;
若height[start]短,start++;
若height[end]短,end--;
即每次刷新最短的隔板。
class Solution {public: int maxArea(vector<int>& height) { int start = 0; int end = height.size() - 1; int max = INT_MIN; while(start < end) { int area = (end-start) * min(height[start], height[end]); max = area > max ? area : max; if(height[start] >= height[end]) { end--; }else { start++; } } return max; }};
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
- Posix多线程编程学习笔记(二)—线程属性(3)
- web.config详解
- Android背景选择器selector 中enable选项失效
- Linux开机启动过程分析
- mysql 存储过程结合游标修改每一行记录的值
- 数组 Container With Most Water
- 二分求幂法
- 登陆csdn的时候需要点击"加载不安全的脚本"的一点想法
- Visual studio2012 C#转为C++
- struts2 <result type = "stream">
- 使用gradle构建java项目
- Scala讲座:函数、操作符及与Java的比较
- MYSQL错误代码对照大全
- 如何更好地限制一个UITextField的输入长度