解题思路双指针 解题思路 双指针 public int maxArea(int[] height){ int maxArea = 0; int l = 0; int r = height.length - 1; while(l < r){ maxArea = Math.max(maxArea,(r-l)*Math.min(height[r],height[l])); if(height[l] < height[r]) l++; else r--; } return maxArea; }