[leetcode] 11. Container With Most Water

转载于 2016-08-15 11:56:09 发布 · 165 阅读

文章标签：

#leetcode #medium

leetcode 专栏收录该内容

179 篇文章

订阅专栏

本文介绍了一种解决两直线与x轴构成的最大盛水量问题的高效算法。通过双指针法，从两端向中间逼近，确保了O(n)的时间复杂度。文章详细解释了解决方案的思路，并给出了具体的C++实现代码。

摘要生成于 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.

解法一：

定义left,right分别指向两边。在当前面积和历史最大面积选最大值。并且让指针移动，寻找更高的边。

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