题目:https://leetcode-cn.com/problems/container-with-most-water/solution/
答案:
一、暴力法
public int maxArea(int[] height) {
int max = 0;
for(int i=0;i<height.length;i++){
for(int j=i+1;j<height.length;j++){
int area = (j-i)*Math.min(height[i],height[j]);
if(area>max){
max = area;
}
}
}
return max;
}
二、 双指针
public int maxArea(int[] height) {
int l = 0, r = height.length-1;
int result =0;
while (l<r){
int area = Math.min(height[l],height[r])*(r-l);
if(area>result) result = area;
if(height[l]<height[r]){
l++;
}else{
r--;
}
}
return result;
}