Container With Most Water

brute force O(n²)

从头尾两头扫面 O(n)

public class Solution {
    public int maxArea(int[] height) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int start = 0;
        int end = height.length - 1;
        int max = 0;
        if(height == null)
            return 0;
        if(height.length < 2)
            return 0;
        while(start < end)
        {
            int tmp = (end - start) * Math.min(height[start], height[end]);
            if(tmp > max)
                max = tmp;
            if(height[start] >= height[end])
            {
                int oldend = end;
                do{end--;} while(start < end&&height[end] < height[oldend]);
            }
            else
            {
                int oldstart = start;
                do{start++;}while(start < end&&height[start] < height[oldstart]);
                
            }
        }
        return max;
        
    }
}