LeetCode Container With Most Water
来源:互联网 发布:淘宝搞笑夸张好评 编辑:程序博客网 时间:2024/04/29 21:39
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.
这一题的解题思路在于,其实不需要n^2的复杂度去遍历所有的左右边组合,只需要从两头网中间找,短边移动,碰到比该边大的边就计算容积是否满足大于原来容积的条件在,这样复杂度是n。
public class Solution { public int maxArea(int[] height) {int i=0,j=height.length-1;int max=height[i]>height[j]?(height[j]*j):(height[i]*j);while(i<j){if(height[i]<height[j]){int l=height[i];while(height[i]<=l&&i<j)i++;int s=height[i]<height[j]?height[i]*(j-i):height[j]*(j-i);if(s>max)max=s;}else{int m=height[j];while(height[j]<=m&&i<j)j--;int s=height[i]<height[j]?height[i]*(j-i):height[j]*(j-i);if(s>max)max=s;}}return max; }}
- LeetCode: Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode Container With Most Water
- LeetCode: Container With Most Water
- [Leetcode] Container With Most Water
- Leetcode: Container With Most Water
- [LeetCode] Container With Most Water
- LeetCode Container With Most Water
- [Leetcode] Container With Most Water
- [LeetCode]Container With Most Water
- LeetCode-Container With Most Water
- Container With Most Water leetcode
- LeetCode - Container With Most Water
- LeetCode: Container With Most Water
- Leetcode: Container With Most Water
- 【LeetCode】Container With Most Water
- Leetcode: Container With Most Water
- LeetCode:Container With Most Water
- C# 手动/自动保存图片
- JavaCC 研究与应用( 8000字 心得 源程序)
- Handler和HandlerThread
- gcc中的内嵌汇编语言(Intel i386平台)
- 返回给定数据的“反序数"
- LeetCode Container With Most Water
- PHP阅读邮件
- sicily 1012.Stacking Cylinders
- 分治 Divide and Conquer 局部最小值 local optimal 棋盘问题
- 今天去了巨人网络笔试
- 分享 VB 学习代码
- Spring事务传播特性实例解析
- 寻找丑数-算法-java语言
- Linux 用 strace调试程序