点击打开链接
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include <limits.h>
#include <assert.h>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
class Solution {
public:
int maxArea(vector<int>& height) {
int start=0, end=height.size(),contain=0;
int maxV=INT_MIN;
while (start<end) {
if(height[start]<height[end]){
contain=height[start]*(end-start);
maxV =max(maxV,contain);
start+=1;
}
else{
contain=height[end]*(end-start);
maxV=max(maxV,contain);
end-=1;
}
}
return maxV;
}
};
int main()
{
Solution temple;
return 0;
}