Container-with-most-water

最新推荐文章于 2021-04-18 11:59:36 发布

原创最新推荐文章于 2021-04-18 11:59:36 发布 · 289 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种解决最大盛水容器问题的高效算法。该算法利用贪心思想，通过双指针技巧寻找能容纳最多水的两个边界，避免了传统穷举法的时间复杂度过高的问题。适用于面试和技术交流。

摘要生成于 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.

code：
public class Solution {
    public int maxArea(int[] height) {
        int result = 0;
        if(height.length <= 1)
            return 0;
        int a = 0;
        int b = height.length -1;
        while(a<b)
        {
            int sum = (b - a) * Math.min(height[b],height[a]);
            if(sum > result) result = sum;
            if(height[a] > height[b])
                b--;
            else
                a++;
        }
        return result;
    }
}

题目使用了贪心的思想。