11. 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 linei 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.

Solution:

Tips:

from two ends to middle, and record the max area for each comparing.

Java Code:

public class Solution {    public int maxArea(int[] height) {        int left = 0;        int right = height.length - 1;        int maxArea = 0;        while (left < right) {            int length = right - left;            int higher = height[left] < height[right] ? height[left++] : height[right--];            maxArea = Math.max(maxArea, length * higher);        }        return maxArea;     }}