给定n个非负整数a1, a2, ..., an, 每个都代表坐标轴上的高,其坐标为(i,ai).可以根据这条数组构建一幅柱形图,每任意两条柱子形成一个水桶,要求找到能盛最多水的水桶的面积。大致如下图,红色的代表盛水的面积:
英语原文:11. Container With Most Water
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 and n is at least 2.
解答:
思路就是从左右两边开始,先算出面积,如果比上次算的面积大就记录下来,然后保留左右较高的柱子,低的柱子换成靠近中间的,再算出面积和上次的比较....重复这个流程直到只剩下两根柱子。
class Solution {
public:
int maxArea(vector<int>& height) {
int result = 0;
int left = 0, right = height.size()-1;
while (left < right)
{
result = max(result, min(height[left],height[right])*(right-left));
if (height[left] < height[right])
left++;
else
right--;
}
return result;
}
};