2020-12-14 11. Container With Most Water

最新推荐文章于 2022-07-23 19:08:46 发布

liuziran09

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量51

点赞数

分类专栏： Leetcode Array

本文链接：https://blog.csdn.net/lleonard16/article/details/111180476

版权

Leetcode 同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

Array

6 篇文章 0 订阅

订阅专栏

该博客讨论了一个计算机科学问题，涉及数组处理和双指针技术。问题要求找到一组垂直线段（由给定非负整数数组表示的高度）中能容纳最多水的两个线段，且不允许倾斜容器。提供的Java解决方案从宽度最大的范围开始，逐步向内移动指针，计算当前水的面积并更新最大面积。示例展示了不同输入情况下算法的输出结果，并给出了问题的约束条件。

摘要由CSDN通过智能技术生成

11. Container With Most Water

Difficulty: Medium

Related Topics: Array, Two Pointers

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 <= 3 * 104
0 <= height[i] <= 3 * 104

Solution

Key: For the problem of trapping water, we can start from the widest range then getting closer to the inner range.

Language: Java

class Solution {
    public int maxArea(int[] height) {
        int l = 0;
        int r = height.length - 1;
        int square = 0;
        
        while (l < r) {
            int h = Math.min(height[l], height[r]);
            int length = r - l;
            square = Math.max(square, h * length);
            if (height[l] < height[r]) {
                l++;
            } else {
                r--;
            }
        }
        return square;
    }
}