LeetCode:Container With Most Water

最新推荐文章于 2019-02-26 20:49:02 发布

yao_hust_iAC

最新推荐文章于 2019-02-26 20:49:02 发布

阅读量559

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/yao_wust/article/details/42142729

LeetCode 专栏收录该内容

89 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的高效算法。给定一系列非负整数，代表坐标上的点，通过这些点绘制垂直线。目标是找到两条线，与x轴一起形成一个容器，使得该容器能盛最多的水。文章提供了详细的解决方案，并附带了实现代码。

题目描述：

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.

代码：

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