[leetcode] Container With Most Water
2015-08-08 16:25
330 查看
![](http://images0.cnblogs.com/blog2015/574541/201508/081617198152927.png)
思路:最大面积等于两条垂直线中较小的一条乘以与x轴相交的长度,可以使用Two Pointers,一个从数组头开始(记为i),一个从数组尾部开始(记为j),当i < j时,一直循环找最大面积,如果height[i] < height[j],则 i++,否则 j--。
Java代码如下:
public int maxArea(int[] height) { int i = 0, j = height.length - 1; int result = Math.min(height[i], height[j]) * (j - i); while (i < j) { int tmp = Math.min(height[i], height[j]) * (j - i); if (tmp > result) result = tmp; if (height[i] < height[j]) i++; else j--; } return result; }
相关文章推荐
- HDU 2473 Junk-Mail Filter(删点)
- 2015 Multi-University Training Contest 5 1009 模板
- 2015 HUAS Summer Trainning #4~B
- opencv waitkey使用注意点
- LeetCode(70)题解: climbing-stairs
- 使用Genymotion调试出现错误INSTALL_FAILED_CPU_ABI_INCOMPATI
- POJ 3007 Organize Your Train part II(枚举)
- uva 529 - Addition Chains
- Snail—1-9这9个数字划分成三个3位数,第一个分别是第二、三个的2倍,3倍
- Spartan6 slave SelectMap configuration fails owing to JTAG?
- JBoss 4.2 MBeans waiting for other MBeans (PersistenceUnit)
- HDU 5358 First One( 2015 Multi-University Training Contest 6)
- fzu 1001 Duplicate Pair
- fzu 1001 Duplicate Pair
- Thai language
- [CareerCup] 4.8 Contain Tree 包含树
- scala学习之:trait的理解
- 算法杂货铺——分类算法之朴素贝叶斯分类(Naive Bayesian classification)
- Duplicate Emails
- hdu 5306 Hiking || 2015 Multi-University Training Contest 6 (优先队列 为小疯子而生)