container-with-most-water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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()==0)    return 0;

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

        while(left < right){
            int tmp = (right-left)*(height[left]>height[right]?height[right]:height[left]);
            if(height[left]<height[right]){
                left++;
            }
            else{
                right--;
            }

            if(max < tmp){
                max = tmp;
            }
        }
        return max;
    }
};