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

LeetCode Container With Most Water

xiexingshishu 2015-12-30 23:59 106 查看
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.

题意:给出一个非负数组,找出其中两个构成的最大容积

思路:从两边开始逐渐缩小区间。如果左边的小于右边的,更新最大容积,并且区间左值右移,否则区间右值左移

Trapping Rain Water相似

代码如下:

class Solution
{
public int maxArea(int[] height)
{
int left = 0, right = height.length - 1;
int ans = 0;

while (left < right)
{
int tmp = 0;
if (height[left] < height[right])
{
tmp = height[left] * (right - left);
left++;
}
else
{
tmp = height[right] * (right - left);
right--;
}

ans = Math.max(ans, tmp);
}

return ans;
}
}
标签: 
章节导航