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.
解决代码：

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