[leetcode 11] Container With Most Water

最新推荐文章于 2025-09-06 17:22:57 发布

「已注销」

最新推荐文章于 2025-09-06 17:22:57 发布

阅读量210

点赞数

CC 4.0 BY-SA版权

分类专栏： [LeetCode 刷题] 文章标签： leetcode Array Two Pointers

本文链接：https://blog.youkuaiyun.com/xinxinxv/article/details/42621271

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

本文介绍了一个寻找能盛最多水的两个线段的算法。给定一系列垂直线段的高度，通过双指针法从两端向中间搜索，寻找能够形成最大矩形的组合。此算法避免了遍历所有组合，提高了效率。

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 start = 0;
        int end = height.size() - 1;
        int res = INT_MIN;
        while (start <= end) {
            int s = min(height[start], height[end])*(end-start);
            res = max(res, s);
            if (height[start] < height[end]) {
                start++;
            } else {
                end--;
            }
        }
        return res;
    }
};