时间复杂度O( ) ,空间复杂度O(n)
class Solution {
public:
int maxArea(vector<int>& height) {
vector<int> currCon(height.size(),0);
for(int i=0;i<height.size();++i){
for(int j=i+1;j<height.size();++j){
if(i==0){
currCon[j] = height[i]>height[j] ? height[j]*(j-i):height[i]*(j-i);
}else{
int currCon_tmp = height[i]>height[j] ? height[j]*(j-i):height[i]*(j-i);
currCon[j] = currCon_tmp>currCon[j]?currCon_tmp :currCon[j];
}
}
}
int max = 0;
for(int i=0;i<currCon.size();++i){
max = currCon[i]>max?currCon[i]:max;
}
return max;
}
};