首页 > 其他 > 详细

Leetcode#11Container With Most Water

时间:2015-05-26 06:51:09      阅读:221      评论:0      收藏:0      [点我收藏+]

Container With Most Water

 Total Accepted: 38727 Total Submissions: 121231My Submissions

Question Solution 


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.




public class Solution {

    int max(int a, int b){

        if(a>b)

            return a;

        else

            return b;

    }

    public int maxArea(int[] height) {

        

       int right = height.length-1, left =0;

        int res = 0;


        while(left < right)

        {

            res = max(res, (right-left)*(height[right]<height[left]?height[right--]:height[left++]));    

        }

        return res;

    }

}


Leetcode#11Container With Most Water

原文:http://7061299.blog.51cto.com/7051299/1655093

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!