【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()==0) return 0;
        int n=height.size();
        int i=0;
        int j=n-1;
        int maxCapacity=0;
        int tmp=0;

        while(i!=j)
        {
            
            if(height[i]<=height[j])
            {
                tmp=height[i]*(j-i);
                i++;
            }else if(height[j]<=height[i])
            {
                tmp=height[j]*(j-i);
                j--;
            }
            
            if(maxCapacity<tmp)
            {
                maxCapacity=tmp;
            }

        }

        return maxCapacity;
    }
};