Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

最新推荐文章于 2024-08-28 08:50:09 发布 · 48 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种利用双指针技巧解决容器最大容量问题的方法，通过遍历数组并计算不同高度间的水容量来找到最大容量。

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