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.

O(n2)的算法比较直观。O(n)的算法思路是，两个指针i,j一个指向height数组头，另一个指向height数组尾。计算当前的最大面积，并和最大面积进行比较。如果height[i] < height[j]，height[i]是短板，无论如何向前移动j也不可能得到更大的面积，此时应该向后移动i。反之，应该向前移动j。直到i和j相遇为止。

class Solution {
public:
    int maxArea(vector<int> &height) {
        int left = 0;
        int right = height.size()-1;
        int area = 0;
        while(left < right)
        {
            area = max(area, min(height[left], height[right])*(right-left));
            if(height[left] < height[right])
                left++;
            else
                right--;
        }
        return area;
    }
};