[leetcode] Container With Most Water

原创于 2015-06-15 22:40:43 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种解决LeetCode上最大盛水容器问题的高效算法。该问题要求从给定的高度数组中找到两个线段，使得这两条线段与x轴构成的容器能盛最多的水。文中提供了一个C++实现的示例，通过双指针法，从两端逐步向中间逼近，最终找到符合条件的最大面积。

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

FROM : https://leetcode.com/problems/container-with-most-water/

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 max=0, a=0, b=height.size()-1;
        while(a < b) {
            int area = (b-a)*min(height[a], height[b]);
            if(area > max) max = area;
            height[a]>height[b] ? b-- : a++;
        }
        return max;
    }
};