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

解题思路：

所谓容积其实就是面积，我们都知道长方形的面积=长*宽，不妨我们就从长最长的长方形找起，即令left = 0，
right = height.size() - 1，但是在找下一个长方形时，长肯定会变短，要弥补这一段损失就必须加宽宽度，
所以一下个就换掉两条宽中较小的那一个。

代码：

 public int maxArea(int[] height) {
        int maxArea = 0;
        int temp = 0;
        int left = 0;
        int right = height.length - 1;
        while (left != right) {
            temp = (right - left) * (height[left] < height[right] ? height[left] : height[right]);
            maxArea = maxArea > temp ? maxArea : temp;
            if (height[left] < height[right])
                left++;
            else
                right--;
        }
        return maxArea;
    }