LeetCode 11. Container With Most Water--Java 解法--困雨水简单版

LeetCode 11. Container With Most Water–Java 解法

此文首发于我的个人博客:LeetCode 11. Container With Most Water–Java 解法–困雨水简单版 — zhang0peter的个人博客


LeetCode题解文章分类:LeetCode题解
LeetCode 所有题目总结:LeetCode 所有题目总结


题目地址:Container With Most Water - LeetCode


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.

Example:

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

很奇怪这道题目我这么晚才看到,之前看到LeetCode 42. Trapping Rain Water时觉得题目怎么这么难,现在才发现,原来这道题目是简化版的困雨水。

这道题目难度的降低在于柱子是没有体积的,

暴力破解的自然会超时,如果从2遍向中间夹即可遍历一遍。

Java解法如下:

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

做完这道题目后可以做一下升级难度的题:LeetCode 42. Trapping Rain Water–算法题–c++解法–困雨水复杂版

©️2020 CSDN 皮肤主题: 编程工作室 设计师: CSDN官方博客 返回首页
实付0元
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、C币套餐、付费专栏及课程。

余额充值