class Solution { public int maxArea(int[] height) { int n = height.length; int l = 0, r = n - 1; int res = 0; while(l < r) { // 每次移动较低的指针,这样不会丢失最大值 res = Math.max(res,Math.min(height[l],height[r]) * (r - l)); if(height[l] < height[r]) { l++; } else { r--; } } return res; } }