题目链接:11. 盛最多水的容器 - 力扣(LeetCode)
贪心算法: 双指针,指向容器的两个边界。
1 class Solution { 2 public int maxArea(int[] height) { 3 int i = 0,j = height.length-1; 4 int max = 0; 5 while(i < j){ 6 int volumn = (j-i) * Math.min(height[i], height[j]); 7 if(volumn > max) max = volumn; 8 if(height[i] < height[j])i++; 9 else j--; 10 } 11 return max; 12 } 13 }