LeetCode#11. Container With Most Water

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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

Input: height = [1,1]
Output: 1

Example 3:

Input: height = [4,3,2,1,4]
Output: 16

Example 4:

Input: height = [1,2,1]
Output: 2

Constraints:

• n == height.length
• 2 <= n <= 105
• 0 <= height[i] <= 104

---

暴力
这题一开始想当然的是暴力遍历去取最大值

class Solution {
    public int maxArea(int[] height) {
    int max=0;
         for (int i = 0; i < height.length; i++) {
             for (int j = i+1; j < height.length-1; j++) {
                 int h=height[i]<height[j]?height[i]:height[j];
                 int w=j-i;
                 int area=h*w;
                 max=max>area?max:area;
             }
         }
         return max;
    }
}

但是数据量一大就会有问题

官方-双指针

class Solution {
    public int maxArea(int[] height) {
        int max=0;int i=0;int j=height.length-1;
        while (i!=j){
            int area=Math.min(height[i],height[j])*(j-i);
            max=Math.max(max,area);
            if (height[i]>height[j]){
                --j;
            }else{
                ++i;
            }
        }
        return max;
    }
}

// TODO 双指针为什么是正确的呢？