LeetCode--11--medium--ContainerWithMostWater

package com.app.main.LeetCode;

/**
 *
 * 11
 * medium
 *
 * 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.
 *
 *
 *
 *
 *
 * 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
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/9/19
 * Time:下午8:50
 */
public class ContainerWithMostWater {

    // brute force
    public int maxArea(int[] height) {

        int max = 0;

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

    }

    // greedy strategy / two pointer
    public int maxArea2(int[] height) {
        int max = 0;
        int l = 0;
        int r = height.length - 1;
        while (l < r) {
            int h = height[l] < height[r] ? height[l] : height[r];
            int w = r - l;
            if (max < w * h) {
                max = w * h;
            }
            if (height[l] < height[r]) {
                l++;
            } else {
                r--;
            }
        }
        return max;
    }
}