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

Container With Most Water

时间:2014-12-21 23:24:28      阅读:220      评论: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.

思路:两根线中,短线决定了总面积。所以从左右两边向中间靠拢

代码:

class Solution {
public:
    int maxArea(vector<int> &height) {
        int max=0;
        int tempArea=0;
        int size=height.size();
        if(size==0) 
            return 0;
        int left=0;
        int right=size-1;
        while(left<right){
            tempArea=min(height[left],height[right])*(right-left);
            height[left]<=height[right]?++left:--right;
            if(tempArea>max) max=tempArea;
        }
        return max;
    }
};

 

Container With Most Water

标签:

原文地址:http://www.cnblogs.com/fightformylife/p/4177214.html

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