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

题目解析
给定n个非负的整数a1,a2 ……an， 去哦中每个代表一个点坐标(i, ai)。一共n个垂直线段。找到两个线段，与X轴形成一个容器，使其能剩最多的水。

其实就是找到这两条线段之后，用最短的线段的长度 * 两个线段之间的距离。

代码解析
让最短的线段逐渐变长，找到这个最大值

public class Solution2 {    public static void main(String[] args) {        int[] height = {1,2,3,4,5,6,8,9};        System.out.println(maxArea(height));    }     public static int maxArea(int[] height) {         int start = 0;         int end = height.length-1;         int max = 0;         while(start < end){             max = Math.max(max,(end-start)*Math.min(height[start],height[end]));             if (height[start] < height[end]) {                    start++;                } else {                    end--;                }         }        return max;        }}