Container With Most Water -- LeetCode 11

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.

Solution 1:

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