leetcode 11 Container With Most Water

最新推荐文章于 2020-02-06 20:13:28 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2020-02-06 20:13:28 发布

阅读量336

点赞数

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

本文链接：https://blog.csdn.net/tengfei461807914/article/details/50598133

版权

leetcode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

原题：
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.
大意：
给你n条线，任意挑两条，求以这两条线的x坐标为长度，最短的那条线给高度的面积的最大值。

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