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.

c++:

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