LeetCode 热题 5/100打卡

最新推荐文章于 2026-01-01 15:45:23 发布

原创最新推荐文章于 2026-01-01 15:45:23 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #c++ #算法

LeetCode 热题 100打卡专栏收录该内容

8 篇文章

订阅专栏

Python:

class Solution:
    def maxArea(self, height: List[int]) -> int:
        left = 0
        right = len(height)-1
        max_area = min(height[left],height[right])*(right-left)
        while left<right:
            if height[left]<height[right]:
                left+=1 
            else:
                right-=1
            area = min(height[left],height[right])*(right-left)
            max_area=max(max_area,area)
        return max_area

C++:

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