classSolution{publicintmaxArea(int[] height){int max =0;for(int i =0; i < height.length -1; i++){for(int j = i +1; j < height.length; j++){int area =(j - i)* Math.min(height[i], height[j]);
max = Math.max(max,area);}}return max;}}
方法二:前后双指针法
classSolution{publicintmaxArea(int[] height){int max =0;int l =0;int r = height.length -1;while(l < r){int area =(r - l)* Math.min(height[l], height[r]);
max = Math.max(max,area);if(height[l]< height[r]){
l++;}else{
r--;}}return max;}}
11.盛最多水的容器11.盛最多水的容器方法一:暴力双指针法方法二:前后双指针法11.盛最多水的容器方法一:暴力双指针法class Solution { public int maxArea(int[] height) { int max = 0; for (int i = 0; i < height.length - 1; i++) { for (int j = i + 1; j < height.length; j++)