leetcode 11. Container With Most Water

Seawolf

1. 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.
   
2. 
   
3. Note: You may not slant the container and n is at least 2.
   
4. 
   
5. 
   
6. 
   
7. The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
   
8. 
   
9. 
   
10. 
    
11. Example:
    
12. 
    
13. Input: [1,8,6,2,5,4,8,3,7]
    
14. Output: 49

复制代码

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

复制代码