[leetcode note] Container With Most Water

最新推荐文章于 2024-09-14 18:52:56 发布

草堂笺

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量315

点赞数

分类专栏： leetcode note 文章标签： leetcode

本文链接：https://blog.csdn.net/piaoruiqing/article/details/103509236

版权

leetcode note 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

时间: 2019-12-24 11:06 AM
题目地址: https://leetcode.com/problems/container-with-most-water/

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 and n is at least 2.

给定n个非负整数a1，a2，…，an，其中每个代表坐标（i，ai）上的一个点。绘制n条垂直线，使线i的两个端点位于（i，ai）和（i，0）。找到两条线，它们与x轴一起形成一个容器，以便该容器包含最多的水。

注意：您可能不会倾斜容器，并且n至少为2。

在这里插入图片描述

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

Solution:

public int maxArea(int[] height) {
    int max = 0, i = 0, j = height.length - 1;
    while (i < j) {
        max = Math.max(height[i] > height[j] ? height[j] * (j-- - i) : height[i] * (j - i++), max);
    }
    return max;
}

Runtime: 1 ms, faster than 100.00% of Java online submissions for Container With Most Water.
Memory Usage: 40 MB, less than 94.23% of Java online submissions for Container With Most Water.

欢迎关注公众号(代码如诗):
在这里插入图片描述