题目
解题思路
-
双指针法
暴力法
见第二段代码
ACcode
双指针法:
class Solution {
public int maxArea(int[] height) {
int i = 0, j = height.length - 1, res = 0;
while(i < j){
res = height[i] < height[j] ?
Math.max(res, (j - i) * height[i++]):
Math.max(res, (j - i) * height[j--]);
}
return res;
}
}
暴力法:
public class Solution {
public int maxArea(int[] height) {
int max = 0;
for (int i = 0; i < height.length; i++) {
for (int j = i + 1; j < height.length; j++) {
int w = Math.abs(j - i); //底边
int l = Math.min(height[i], height[j]); //高
max = Math.max(w * l, max);
}
}
return max;
}
}