题目
解法
①数组+双指针
import java.lang.Math;
class Solution {
public int maxArea(int[] height) {
int len = height.length;
int ret = Math.min(height[0], height[len - 1]) * (len - 1 - 0);
int i = 0;
int j = len - 1;
while(i < j){
if(Math.min(height[i], height[j]) * (j - i) > ret){
ret = Math.min(height[i], height[j]) * (j - i);
}
if(height[j] > height[i]){
i++;
}
else{
j--;
}
}
return ret;
}
}