方法一:暴力破解
public static int maxArea(Integer[] height) { int mostWater=0; for(int i=0;i<height.length-1;i++){ for(int j=i+1;j<height.length;j++){ int tempWater=(j-i)*Math.min(height[i],height[j]); if(tempWater>mostWater){ mostWater=tempWater; } } } return mostWater; }方法二:双指针法
private static int maxAreaDoubleIndex(Integer[] height){ int maxArea=0; int l=0,r=height.length-1; while(l<r){ maxArea=Math.max((r-l)*Math.min(height[l],height[r]),maxArea); if(height[l]<height[r]){ l++; }else{ r--; } } return maxArea; }