【LeetCode】Container With Most Water

最新推荐文章于 2020-08-23 15:53:30 发布

LarryInTokyo

最新推荐文章于 2020-08-23 15:53:30 发布

阅读量604

点赞数

分类专栏： LeetCode

LeetCode 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一个使用贪心算法解决的问题：给定一系列垂直线段，找出两条线段与x轴构成的最大容器容量。通过不断更新左右边界和最大面积来实现算法。

摘要生成于 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 size = height.size();  
        if(size < 2)  
            return 0;  
         
        int left = 0, right = size-1;  
        int maxarea = 0;  
        while(left < right)  
        {  
            int smaller = height[left] > height[right] ? height[right] : height[left];  
            int area = (right - left) * smaller;  
            maxarea = maxarea > area ? maxarea : area;  
            if(height[left] <= height[right])  
            {  
                left++;  
            }  
            else  
                right--;  
        }  
        return maxarea;  
    }  
};