11. Container With Most Water

最新推荐文章于 2022-03-26 22:15:02 发布

Gao__Xiong

最新推荐文章于 2022-03-26 22:15:02 发布

阅读量599

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/Gao__Xiong/article/details/53457079

版权

leetcode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的高效算法。该算法利用双指针技术，从两端向中间逼近，确保了O(n)的时间复杂度。适用于需要找到最佳组合以最大化特定目标的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.
解决代码：

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