标签:
public int maxArea(int[] height) { //http://blog.csdn.net/linhuanmars/article/details/21145429 贪心算法要看看 if(height==null || height.length<2) return 0; int max = 0; int l=0, h = height.length-1; while(l<h){ max = Math.max(max,Math.min(height[l], height[h])*(h-l)); if(height[l]<height[h]){ l++; }else{ h--; } } return max; }
标签:
原文地址:http://www.cnblogs.com/jiajiaxingxing/p/4414215.html