class{ publicintmaxArea(int[] height){ if (height==null||height.length<=1){ return0; } int len=height.length; int max=0; int sum=0; for (int i=0;i<len;i++){ for (int j=len-1;j>i;j--) { sum = (j - i) * (Math.min(height[i], height[j])); if (max < sum) { max = sum; } }
class{ publicintmaxArea(int[] height){ if (height==null||height.length<=1){ return0; } int len=height.length; int i=0,j=len-1;
int max=0; while(i!=j){ if (height[i]<height[j]) { int sum = (j - i) * height[i]; if (max < sum) { max = sum; } i++; }else { int sum = (j - i) * height[j]; if (max < sum) { max = sum; } j--; } } return max; } }
近期评论