Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container.
1 int maxArea(vector<int>& height) { 2 int len=height.size(); 3 int max_area=0; 4 int left=0,right=len-1; 5 while(right>left) 6 { 7 max_area=max(max_area,min(height[right],height[left])*(right-left)); 8 if(height[left]<height[right]) 9 left++; 10 else 11 right--; 12 } 13 return max_area; 14 15 }
原文：http://www.cnblogs.com/hexhxy/p/4797885.html