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

Container With Most Water

时间:2014-09-30 00:30:11      阅读:211      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   io   os   ar   strong   for   sp   

题目描述:

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 class Solution {
 2 public:
 3     int maxArea(vector<int> &height) {
 4         int maxAre = 0;
 5         int area = 0;
 6         int len = height.size();
 7         int left = 0;
 8         int right = len -1;
 9         while(left < right){
10             int high = height[left] > height[right]? height[right]:height[left];
11             area = high * (right - left);
12             if(area > maxAre){
13                 maxAre = area;
14             }else if(height[left] > height[right]){
15                 right--;
16             }else {
17                 left++;
18             }
19             
20         }
21         return maxAre;
22     }
23 };

 

Container With Most Water

标签:style   blog   color   io   os   ar   strong   for   sp   

原文地址:http://www.cnblogs.com/skycore/p/4001119.html

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