leetcode11. 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.

O(N^2)超时，典型贪心，一步步左右向中间贪心即可。O(N)

public class Solution {
    public int maxArea(int[] height) {
        int Max = 0;
        int area = 0;

            int l = 0;
            int r = height.length-1;
            while(l!=r) {
                int t = Math.min(height[l], height[r]);
                area = t * (r - l);
                Max = Math.max(Max, area);
                if (height[l] < height[r]) {
                    l++;
                } else {
                    r--;
                }
            }
        return Max;
    }
}