leetcode.11. Container With Most Water

class Solution {
public:
    int maxArea(vector<int>& height)
    {
        int maxcon=0;
        int i=0;
        int  h;
        int j=height.size()-1;
        while(i<j)
        {
            h=min(height[i],height[j]);
           //printf("%d %d %d",h,j,i);
            maxcon=max(maxcon,h*(j-i));
            //printf("\n%d",maxcon);
            while (height[i]<=h) i++;
            while (height[j]<=h) j--;
        }
      return maxcon;
    }
};