(Leetcode)11. Container With Most Water
来源:互联网 发布:ios屏幕检测软件 编辑:程序博客网 时间:2024/06/06 19: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.
题意:
找到条纵线然后这两条线以及X轴构成的容器能容纳最多的水。
思路:
面积,它受长和高的影响,当长度减小时候,高必须增长才有可能提升面积,所以我们从长度最长时开始递减,然后寻找更高的线来更新候补;
public int maxArea(int[] height) { int left = 0; int right = height.length-1; int area = 0 ; while(left<right){ area = Math.max(area, Math.min(height[left], height[right])*(right-left)); if(height[left]<height[right]){ left ++; } else{ right --; } } return area; }
0 0
- (Leetcode)11. Container With Most Water
- LeetCode 11. Container With Most Water
- [LeetCode]11.Container With Most Water
- LeetCode --- 11. Container With Most Water
- LeetCode 11.Container With Most Water
- [Leetcode] 11. Container With Most Water
- [leetcode] 11.Container With Most Water
- 【leetcode】11. Container With Most Water
- [LeetCode]11. Container With Most Water
- 11. Container With Most Water LeetCode
- leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- [LeetCode OJ]11. Container With Most Water
- [leetcode] 11. Container With Most Water
- Leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- leetcode 11. Container With Most Water
- LeetCode 11. Container With Most Water
- 旅行售货员问题的回溯法求解
- UVa 1600(未通过)
- HDU 2444.The Accomodation of Students【二分图判断+最大匹配】【5月4】
- 推荐系统的评价指标总结
- hibernate注解简单使用
- (Leetcode)11. Container With Most Water
- NIO边看边记 之 FileChannel(七)
- 从EXCEL中读出数据到数据库中
- [线段树 中位数] BZOJ 4071 [Apio2015]巴邻旁之桥
- XFire创建WebService服务端和客户端
- ubuntu 安装lamp
- 解决SecureCRT下spark-shell中scala无法删除问题
- POJ 3636 Nested Dolls
- Java Web 学习笔记 —— eclipse 环境搭建