class Solution {
public:
int maxArea(vector<int> &height) {
int start = 0;
int end = height.size() - 1;
int result = INT_MIN;
while (start < end)
{
int tmp = min(height[start], height[end])*(end - start);
result = max(tmp, result);
if (height[start] < height[end])
{
start++;
}
else
{
end--;
}
}
return result;
}
};
【LeetCode】Container With Most Water
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章
leetcode-112-路径总和
叄贰壹
2020-07-08 12:04:52
leetcode:实现 Trie (前缀树)
zhangxiaojiakele
2020-07-08 11:07:35
学算法要读《算法导论》吗?
原創
2024-03-28 00:34:50
leetcode:石子游戏
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:按摩师
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:词典中最长的单词
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:石子游戏II
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:等差数列划分
zhangxiaojiakele
2020-07-08 11:07:38
leetcode: 连续子数组的最大和
zhangxiaojiakele
2020-07-08 11:07:38
leetcode:二进制中1的个数
zhangxiaojiakele
2020-07-08 11:07:36
leetcode: 最低票价
zhangxiaojiakele
2020-07-08 11:07:35
leetcode:剪绳子
zhangxiaojiakele
2020-07-08 11:07:34
leetcode:最小的k个数
zhangxiaojiakele
2020-07-08 11:07:32
leetcode:距离原点最近的K个点
zhangxiaojiakele
2020-07-08 11:07:32