Container With Most Water(C++)

class Solution {
public:
int maxArea(vector<int>& height)
{
int l=0,r=height.size()-1;
int area=0;
while(l<r)
{
area=max(area,min(height[l],height[r])*((r-l)));
if(height[l]<height[r])
l++;
else
r--;
}
return area;
}
};

Container With Most Water(C++)相关推荐

【贪心+双指针】LeetCode 11. Container With Most Water
LeetCode 11. Container With Most Water Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4455109.ht ...
Container with most water（盛水最多的容器）
Container with most water(盛水最多的容器) 简单的证明如图题目: 给定 n 个非负整数 a1,a2,-,an,每个数代表坐标中的一个点 (i, ai) .在坐标内画 n ...
leetcode -eleven:Container With Most Water
2019独角兽企业重金招聘Python工程师标准>>> Given n non-negative integers a1, a2, ..., an, where each repre ...
C#LeetCode刷题之#11-盛最多水的容器（Container With Most Water）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3615 访问. 给定 n 个非负整数 a1,a2,...,an,每 ...
【LeetCode】11. Container With Most Water 解题小结
题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, a ...
LeetCode 11.Container With Most Water
题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, a ...
LeetCode 11 Container With Most Water
问题:给出一个数组nums,要求选择2个,使得容器中包含的水最多. 思路:假设选取x,y,其中x<y,则包含的水为min(x,y)*(index(y) - index(x)).此时应该选择在最小 ...
leetcode - Container With Most Water
题目链接:http://oj.leetcode.com/problems/container-with-most-water/ 第一个解法是用两个数组双向记录.方法的时间复杂度是O(n+max).这里 ...
LeetCode11：Container With Most Water
public int MaxArea(int[] height) {int start=0;int end=height.Length-1;int max=0;while(start<end){ ...
[leetcode] Container With Most Water
思路:最大面积等于两条垂直线中较小的一条乘以与x轴相交的长度,可以使用Two Pointers,一个从数组头开始(记为i),一个从数组尾部开始(记为j),当i < j时,一直循环找最大面积,如果 ...

Container With Most Water(C++)

Container With Most Water(C++)相关推荐

最新文章

热门文章