publicclassSolution{publicintmaxArea(int[] height){int left =0;int right = height.length-1;int vomumn =0;while(left < right ){int area =Math.min(height[left ],height[right ])*(right -left)
volumn =Math.max(volumn,area)// 移动较小的数字指针if(height[left]<=height[righ]){++left
}else{-- right
}}return volumn
}
题1:盛最多水的容器解题:双指针初始两个左右指针,可容纳水量min(左指针,右指针)*指针间距S(i, j) = min(h[i], h[j]) × (j - i)移动数字较小的指针,min(h[i],h[j])可能变大public class Solution { public int maxArea(int[] height) { int left = 0; int right = height.length-1; int vomumn = 0; while(