问题描述:
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, a[i]>, 找出所能构成的最大的容量。
1. 初始最大容量设定 <0, a[0]>, <n - 1, a[n - 1]>
2. 每次更新最短的边
示例代码:
int maxArea(vector<int> &height)
{
int maxVal = INT_MIN;
int n, i, j;
n = height.size();
assert(n >= 2);
for (i = 0, j = n - 1; i < j; )
{
int vol = (j - i) * (height[j] < height[i] ? height[j--] : height[i++]);
if (vol > maxVal) maxVal = vol;
}
return maxVal;
}