//双指针法
class Solution {
public int maxArea(int[] height) {
int i = 0, r = height.length - 1;
int ans = 0;
while(i < r){
int area = Math.min(height[i], height[r]) * (r - i);
ans = Math.max(ans, area);
if(height[i] <= height[r]){
++i;
}else {
--r;
}
}
return ans;
}
}
题解过程:
1 8 6 2 5 4 8 3 7
1 7 => min(1, 7) * 8 = 8;
8 7 => min(8, 7) * 7 = 49;
8 3 => min(3, 8) * 6 = 18;
8 8 => min(8, 8) * 5 = 40;
6 8 => min(6, 8) * 4 = 24;
2 8 => min(2, 8) * 3 = 6;
5 8 => min(5, 8) * 2 = 10;
4 8 => min(4, 8) * 1 = 4;
最终得到MAX=48
时间复杂度:O(n)
空间复杂度:O(1)