leetcode: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) {                if (height.size() < 2)            return 0;                    int begin = 0;        int end   = height.size()-1;        int maxArea = INT_MIN;                while (begin < end)        {            maxArea = max(maxArea, min(height[begin], height[end]) * (end-begin));                        if (height[begin] <= height[end])                begin++;            else                end--;        }                return maxArea;    }};