leetcode 11. Container With Most Water

int maxArea(vector<int>& height){

    int left =0 , right = height.size()-1 , maxA=0;

    while(left<right){

        int tmp = (right - left)*(height[right]<height[left]?height[right--]:height[left++]);

        maxA = max(maxA,tmp);

    }

    return maxA;

}