您的位置:首页 > 大数据 > 人工智能

Container With Most Water

2015-10-11 04:50 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.

解题思路

面积只看边界的两条线,和中间的线没关系。两个指针i,j分别指向头和尾,如果头小,i++,否则j++。

代码

public class Solution {
public int maxArea(int[] height)
{
int i=0;
int j=height.length-1;
int max=0;

while(j>i)
{
int tmp=height[i]<=height[j]?height[i]:height[j];
if(tmp*(j-i)>max)
max=tmp*(j-i);

if(height[i]<=height[j])
++i;
else
--j;
}

return max;
}
}


运行结果

内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: