leetcode:Container With Most Water

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