盛最多的水 container-with-most-water
题目描述
给定n个非负整数a1,a2,…,an,其中每个数字表示坐标(i, ai)处的一个点。以(i,ai)和(i,0)(i=1,2,3…n)为端点画出n条直线。你可以从中选择两条线与x轴一起构成一个容器,最大的容器能装多少水?
注意:你不能倾斜容器
例如:
输入 [1,8,6,2,5,4,8,3,7]
输出: 49
Given n non-negative integers a1 , a2 , …, an , where each represents a point at coordinate (i, ai ). nvertical 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.
示例
输入
[1,8,6,2,5,4,8,3,7]
输出
49
解题思路
- 双指针,从两边往中间收缩,并且由于宽度减小,所以每次收缩时要舍弃短板
- left和right分别初始为0和size - 1,从宽度最大的情况开始
- area用于记录每次收缩后的容量,初值为0
area = (right - left) * min(height[left], height[right]) - result用于记录最大的容量
result = max(result, area)
class Solution {
public:
int maxArea(vector<int>& height) {
int size = height.size();
int left(0), right(size - 1), area(0), result(0);
while(left < right) {
area = (right - left) * min(height[left], height[right]);
result = max(result, area);
//每次舍弃较短的板子
height[left] < height[right] ? left ++ : right --;
}
return result;
}
};