LeetCode 11 Container with Most Water

最新推荐文章于 2024-10-07 11:40:27 发布

原创最新推荐文章于 2024-10-07 11:40:27 发布 · 283 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

370 篇文章

订阅专栏

LeetCode Two Pointers

25 篇文章

订阅专栏

给定一个非负整数数组，表示一系列点的坐标。数组中的每个元素代表坐标(i, ai)处的一个垂直线段。找出两条垂直线段，它们与x轴形成一个容器，使得该容器能容纳最多的水。注意容器不能倾斜。例如，输入数组为[1, 8, 6, 2, 5, 4, 8, 3, 7]时，最大容量的水区域面积为49。解决方案提供了一种Java实现，通过双指针法找到最大面积。

很经典的题目自然不必多说

11. Container With Most Water

Difficulty: Medium

Related Topics: Array, Two Pointers, Greedy

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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example 2:

Input: height = [1,1]
Output: 1

Example 3:

Input: height = [4,3,2,1,4]
Output: 16

Example 4:

Input: height = [1,2,1]
Output: 2

Constraints:

n == height.length
2 <= n <= 105
0 <= height[i] <= 104

Solution

Language: Java

class Solution {
    public int maxArea(int[] height) {
        int i = 0;
        int j = height.length - 1;
        
        int max = Integer.MIN_VALUE;
        while (i < j) {
            max = Math.max(max, Math.min(height[i], height[j]) * (j - i));
            if (height[i] <= height[j]) {
                i++;
            } else {
                j--;
            }
        }
        return max;
        
    }
}