Container With Most Water
2015-08-06 21:25
471 查看
题目
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.
思路
该问题可在O(n)O(n)时间内解决.在计算区域面积时,我们以min(height[i], height[j])作为高,假如height[i] < height[j],因为对于任意的j,min(height[i], height[j])所能返回的最大值为height[i],所以我们可以忽略line i与区间[i,j]内其他line组成的区域的计算;同理当height[i] > height[j]时,可以忽略line j与区间[i,j]内其他line组成的区域
代码
public class Solution { public int maxArea(int[] height) { int i = 0, j = height.length-1, area = 0; while(i < j){ area = Math.max(area, (j-i) * Math.min(height[i], height[j])); if(height[i] < height[j]) i++; else j--; } return area; } }
相关文章推荐
- Container With Most Water
- 2015 HUAS Summer Trainning #4~D
- Doing Homework again SDUT 2076
- 2015 Multi-University Training Contest 2
- DELL R710 服务器更换硬盘后,重建RAID1 重装操作系统 无法启动
- POJ 1804 Brainman
- HDOJ1789Doing Homework again(贪心)
- 2015 Multi-University Training Contest 6 hdu 5360 Hiking
- HDU-- 2015 Multi-University Training Contest 6 Cake
- hdu 5360 Hiking(2015 Multi-University Training Contest 6)
- hdu 4750——Count The Pairs
- HDOJ 题目4251The Famous ICPC Team Again(划分树)
- hdu 5353 Average(2015 Multi-University Training Contest 6)
- HDU 5360 Hiking(优先队列)2015 Multi-University Training Contest 6
- POJ 3414 Paid Roads(状态压缩最短路)
- chain
- Codeforces Gym 100342C Problem C. Painting Cottages 暴力
- Codeforces A. Lineland Mail
- 2015 Multi-University Training Contest 6
- 实参和形参指针做函数参数时,如何改变main函数变量的值