【leetcode-11】 Container With Most Water

【leetcode-11】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 and n is at least 2.

class Solution11 {
    public int maxArea(int[] height) {
		 int max=0;
		 for(int i=0;i<height.length;i++) {
			 for(int j=0;j<i;j++) {
				
                 int size=(i-j)*(height[j]>height[i]?height[i]:height[j]);
					 if(size>max) {
						 max=size;
					 }
				}
				 
		 }
		 
		 
		
		 return max;
	        
	    
	 }
}