题目:
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.
难度:medium
思路:
盛水容器的容积为较短的一边乘以x轴坐标差。通过两个指针分别指在最左和最右,然后每次计算当前的容积,若是大于之前的最大容积则进行替换。之后通过移动较短高度一侧的指针来寻找更高的高度。
代码如下
class Solution {
public:
int maxArea(vector<int>& height) {
int maxCapability=0;
int tempCapability=0;
int left=0;
int right=height.size()-1;
while(right>left){
tempCapability=(right-left)*min(height[right],height[left]);
if(maxCapability<tempCapability)
maxCapability=tempCapability;
if(height[right]>height[left])
left++;
else
right--;
}
return maxCapability;
}
};