11. Container With Most Water

最新推荐文章于 2022-07-23 19:08:46 发布

是三水不是泗水

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量106

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/csg3140100993/article/details/102720666

LeetCode 专栏收录该内容

56 篇文章

订阅专栏

本文探讨了如何从一组垂直线中找出两线，与x轴形成的最大盛水容器。通过双指针技术，实现高效求解最大面积的算法。输入为一系列坐标点的高度，输出为最大盛水量。

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

11. Container With Most Water

Medium

4127482FavoriteShare

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). nvertical 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 and n is at least 2.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

Accepted

471,601

Submissions

997,445

class Solution {
public:
    int maxArea(vector<int>& height) {
    	int ans=0;
        for(int i=0,j=height.size()-1;i<j;){//双指针
        	ans=max(ans,min(height[j],height[i])*(j-i));
            height[i]<height[j]?i++:j--;
        }
        return ans;
    }
};