leetcode：Container With Most Water 【Java】

最新推荐文章于 2021-02-15 16:05:09 发布

tterminator

最新推荐文章于 2021-02-15 16:05:09 发布

阅读量371

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/tterminator/article/details/50812485

leetcode 专栏收录该内容

79 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的高效算法。通过双指针技巧，从两端逐步逼近，找到最佳组合。

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

一、问题描述

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.

二、问题分析

设两个指针，分别从前往后和从后往前搜索。

三、算法代码

public class Solution {
    public int maxArea(int[] height) {
        int start = 0;
        int end = height.length - 1;
        int capacity = 0;
        int result = 0;
        while(start < end){
            capacity = Math.min(height[start] , height[end]) * (end - start);
            result = Math.max(result, capacity);
            if(height[start] <= height[end]){
                start++;
            }else{
                end--;
            }
        }
        return result;
    }
}