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++解法–困雨水复杂版

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

【贪心+双指针】LeetCode 11. Container With Most Water
LeetCode 11. Container With Most Water Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4455109.ht ...
LeetCode 11 Container With Most Water
问题:给出一个数组nums,要求选择2个,使得容器中包含的水最多. 思路:假设选取x,y,其中x<y,则包含的水为min(x,y)*(index(y) - index(x)).此时应该选择在最小 ...
LeetCode 11.Container With Most Water
题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, a ...
leetcode 11. Container With Most Water
题意:题目大概意思就是让你找两个数使得两个数的最小值乘以他们的距离最大Area 题解:设置两个变量, 一个是从头开始,一个是从尾开始,计算两个数的Area,并更新最大值,如果开始的元素大于结尾的元素则 ...
LeetCode 804 Unique Morse Code Words--python,java解法
题目地址:Unique Morse Code Words - LeetCode Difficulty:easy Acceptance:74.1% International Morse Code de ...
【LeetCode】11. Container With Most Water 解题小结
题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, a ...
leetcode -eleven:Container With Most Water
2019独角兽企业重金招聘Python工程师标准>>> Given n non-negative integers a1, a2, ..., an, where each repre ...
11. Container With Most Water
2019独角兽企业重金招聘Python工程师标准>>> 就是说,x轴上在1,2,...,n点上有许多垂直的线段,长度依次是a1, a2, ..., an.找出两条线段,使他们和x抽围 ...
基于java SSM图书管理系统简单版设计和实现
本项目演示链接地址 > 主要技术:后台采用技术: SSM框架(SpringMVC + Spring + Mybatis) 前台采用技术: div + css 功能比较简单.适合学习使用主要功能 ...

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

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

最新文章

热门文章