LeetCode 11. Container With Most Water

最新推荐文章于 2024-10-29 13:54:07 发布

原创最新推荐文章于 2024-10-29 13:54:07 发布 · 182 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Algorithm

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了解决LeetCode11题目的算法实现，该题目要求在给定的一系列垂直线中找到两个线段构成的容器能盛最多的水量。采用双指针法进行求解，从两端向中间逼近，确保复杂度为O(n)。

LeetCode 11. Container With Most Water

Description

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 and n is at least 2.

    class Solution {
        public int maxArea(int[] height) {
            int lo = 0;
            int hi = height.length - 1;
            int maxarea = 0;

            while (lo < hi) {
                maxarea = Math.max(maxarea, Math.min(height[lo], height[hi]) * (hi - lo));
                if (height[lo] < height[hi]) {
                    lo++;
                }
                else
                    hi--;

            }
            return maxarea;
        }
    }