Container With Most Water leetcode

原创于 2013-08-28 13:23:05 发布 · 620 阅读

CC 4.0 BY-SA版权

本文介绍了一种求解垂直线形成的容器中最多水量的方法，通过遍历数组并使用双指针技巧，优化了计算过程，提高了效率。

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

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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) {
        
        
        if(height==null || height.length<=1) return 0;
        
        int begin = 0,end = height.length-1;
        
        int max = 0;
        while(begin<end){
            int now = (end-begin)*Math.min(height[begin],height[end]);
            
            if(now>max) max = now;
            
            if(height[begin]>height[end])
                end--;
            else
                begin++;
        }
        return max;
    }
}