【LeetCode】11. Container With Most Water 解题小结

题目：

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.

一般的方法就是嵌套两个for循环，不过提交的时候就超时了。那么换个角度考虑，先从最宽的情况，也就是height.size()-1到0这个横坐标之间最大的水容量，比较两者的a_n-1和a₀哪个小一些。然后逐渐往中间靠拢，只有比min(a_n-1，a₀)高的才会被考虑，计算水容量大小，如果比之前大，则更新axis。

class Solution {
public:int maxArea(vector<int>& height) {int tmpArea = 0;int i = 0, j = height.size()-1;while (i < j){int h = height[i] > height[j] ? height[j]:height[i];tmpArea = h * (j - i) > tmpArea ? h * (j - i) : tmpArea;while (height[i] <= h && i < j)i++;while (height[j] <= h && i < j)j--;}return tmpArea;}
};

转载于:https://www.cnblogs.com/Doctengineer/p/5813127.html

【LeetCode】11. Container With Most Water 解题小结相关推荐

【贪心+双指针】LeetCode 11. Container With Most Water
LeetCode 11. Container With Most Water Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4455109.ht ...
LeetCode 11 Container With Most Water
问题:给出一个数组nums,要求选择2个,使得容器中包含的水最多. 思路:假设选取x,y,其中x<y,则包含的水为min(x,y)*(index(y) - index(x)).此时应该选择在最小 ...
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
题意:题目大概意思就是让你找两个数使得两个数的最小值乘以他们的距离最大Area 题解:设置两个变量, 一个是从头开始,一个是从尾开始,计算两个数的Area,并更新最大值,如果开始的元素大于结尾的元素则 ...
LeetCode 11. Container With Most Water--Java 解法--困雨水简单版
LeetCode 11. Container With Most Water–Java 解法此文首发于我的个人博客:LeetCode 11. Container With Most Water–Ja ...
leetcode -eleven:Container With Most Water
2019独角兽企业重金招聘Python工程师标准>>> Given n non-negative integers a1, a2, ..., an, where each repre ...
11. Container With Most Water
2019独角兽企业重金招聘Python工程师标准>>> 就是说,x轴上在1,2,...,n点上有许多垂直的线段,长度依次是a1, a2, ..., an.找出两条线段,使他们和x抽围 ...
LeetCode第45场双周赛-解题报告
LeetCode第45场双周赛-解题报告 A. 唯一元素的和原题链接 https://leetcode-cn.com/problems/sum-of-unique-elements/ 解题思路因为 ...
[贪心|双指针] leetcode 11 盛最多水的容器
[贪心|双指针] leetcode 11 盛最多水的容器 1.题目题目链接给你 n 个非负整数 a1,a2,-,an,每个数代表坐标中的一个点 (i, ai) .在坐标内画 n 条垂直线,垂直线 ...

【LeetCode】11. Container With Most Water 解题小结

【LeetCode】11. Container With Most Water 解题小结相关推荐

最新文章

热门文章