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.
x軸上在1,2,…,n點上有許多垂直的線段，長度依次是a1, a2, …, an。找出兩條線段，使他們和x抽圍成的面積最大。面積公式是 Min(ai, aj) X |j - i|
思路：
1、兩邊夾逼，選取面積最大的；
代碼：

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