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

Leetcode#11Container With Most Water

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

标签:represents   together   vertical   where   

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

标签:represents   together   vertical   where   

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

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