leetcode Container With Most Water 难度系数3 3.4

最新推荐文章于 2025-06-13 08:30:00 发布

原创最新推荐文章于 2025-06-13 08:30:00 发布 · 948 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #java #面试

leetcode java 150 专栏收录该内容

86 篇文章

订阅专栏

本文详细阐述了如何使用双指针法解决经典容器容量问题，通过比较左右指针所指向柱状图的高度来确定当前可能的最大容器容量，并通过移动高度较低的指针来尝试寻找更大的容量。

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

Question：

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) {
    	if (height.length==0) {
			return 0;
		}
        int first = 0;
        int last = height.length-1;
        int area = 0;
        int result = 0;
        int minHeight = 0;
        while(first<last){
        	minHeight =  Math.min(height[first], height[last]);
        	area = minHeight*(last-first);
        	result = Math.max(area, result);
        	if (height[first]<=height[last]) {
				first++;
			}else {
				last--;
			}
        }
        return result;
    }
}