LeetCode——Container With Most Water

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

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.

• Example:
  Input: [1,8,6,2,5,4,8,3,7]
  Output: 49

解法一

遍历数组，算出最大的数

public int maxArea(int[] height) {
        int max=0;
        for(int i=0;i<height.length;i++)
        {
        	for(int j=i+1;j<height.length;j++)
        	{
        		max=Math.max(Math.min(height[i],height[j])*(j-i), max);
        	}
        }
        return max;
    }

Runtime: 208 ms, faster than 27.55% of Java online submissions for Container With Most Water.
Memory Usage: 40.5 MB, less than 29.12% of Java online submissions for Container With Most Water.

解法二

两个指针一个指向头一个指向尾，同时向中间

public int maxArea(int[] height){
		int max=0,left=0,right=height.length-1;
		while(left<right)
		{
			int h=Math.min(height[left], height[right]);
			max=Math.max(max, h*(right-left));
			while(left<right&&h==height[left])
				left++;
			while(right>left&&h==height[right])
				right--;
		}
		return max;
	}

Runtime: 4 ms, faster than 98.95% of Java online submissions for Container With Most Water.
Memory Usage: 40.3 MB, less than 54.45% of Java online submissions for Container With Most Water.