https://leetcode.com/problems/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.
Subscribe to see which companies asked this question.
题意:给你一个数组,从a1,a2...an,来描述n个点:(1,a1)、(2,a2)、(i,ai)、(n,an),对每个点画一条线垂直于x轴,任选两条线作为玻璃,问往里面倒水最多能倒多少?
解答:一开始写了个暴力,结果超时了。后来优化了一下,假设a1为短板,那么要使a1为玻璃,那么要距离它最远的比它长的线,找到即可。
class Solution {
public:
int maxArea(vector<int>& height) {
int size = height.size();
int ans = 0;
for(int i=0;i<size;i++)
{
int l=0,r=size-1;
while(height[i]>height[r])
{
r--;
}
while(height[i]>height[l])
{
l++;
}
ans=max(ans,height[i]*(r-i));
ans=max(ans,height[i]*(i-l));
}
return ans;
}
};