Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

CodeAsWind

最新推荐文章于 2024-08-28 08:50:09 发布

阅读量429

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/CodeAsWind/article/details/38072535

LeetCode 专栏收录该内容

36 篇文章

订阅专栏

Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

解题方法：

题目大意，给出高度数组，求出数组间两个高度之间的最大盛水量！！

Code:

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