题目:
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.
x轴上在1,2,…,n点上有许多垂直的线段,长度依次是a1, a2, …, an。找出两条线段,使他们和x抽围成的面积最大。面积公式是 Min(ai, aj) X |j - i|
思路:
1、两边夹逼,选取面积最大的;
代码:
class Solution {
public:
int maxArea(vector<int> &height) {
int i=0,j=height.size()-1;
int result=0;
while(i<j)
{
int area=(j-i)*min(height[i],height[j]);
result=max(result,area);
if(height[i]<=height[j]) i++;
else j--;
}
return result;
}
};