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

Container With Most Water

时间:2014-06-04 21:09:33      阅读:307      评论:0      收藏:0      [点我收藏+]

标签:c   style   class   blog   code   java   

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.

bubuko.com,布布扣
class Solution {
public:
    int maxArea(vector<int> &height) {
        int left=0;
        int right=height.size()-1;
        int max=0;
        while(left<right)
        {
            int area=height[left];
            if(height[left]>height[right]) area=height[right];
            area=area*(right-left);
            if(area>max) max=area;
            if(height[left]<height[right]) left++;
            else right--;
        }
    
        return max;
    }
}; 
bubuko.com,布布扣

Container With Most Water,布布扣,bubuko.com

Container With Most Water

标签:c   style   class   blog   code   java   

原文地址:http://www.cnblogs.com/erictanghu/p/3759226.html

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