码迷,mamicode.com
首页 > 其他好文 > 详细

Container With Most Water

时间:2015-09-10 16:06:48      阅读:101      评论:0      收藏:0      [点我收藏+]

标签:

Given n non-negative integers a1a2, ..., an, where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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     }

 

Container With Most Water

标签:

原文地址:http://www.cnblogs.com/hexhxy/p/4797885.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!