Leetcode-Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) 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.

Analysis:

 

Solution:

 1 public class Solution {
 2     public int maxArea(int[] height) {
 3         int max = 0;
 4         int head = 0;
 5         int end = height.length-1;
 6        
 7         while (head<end){
 8             int left = height[head];
 9             int right = height[end];
10             int vol = (end-head)*Math.min(left,right);
11             if (vol>max) max = vol;
12 
13             if (left<=right)
14                 while (head<end && left>=height[head]) head++;
15             else 
16                 while (head< end && right>=height[end]) end--;
17         }
18         
19         return max;   
20         
21     }
22 }

 

posted @ 2014-11-28 04:44  LiBlog  阅读(120)  评论(0)  编辑  收藏  举报