LeetCode 11.Container With Most Water

//C++
int maxArea(vector<int>& height) 
{
	int Max = 0; int temp = 0;
	for (int i = 0; i < height.size(); i++)
	{
		for (int j = 0; j < i; j++)
		{
			if (height[j] < height[i])
				temp = height[j] * (i - j);
			else
				temp = height[i] * (i - j);
			if (temp > Max)
				Max = temp;
		}
	}
	return Max;
}

//java
class Solution {
    public int maxArea(int[] height) {
        int max=0;
        for(int i=1;i<height.length;i++)
        {
            int l1=height[i];

            for(int j=i-1;j>=0;j--)
            {
                int l2=height[i];
                if(l2>height[j])
                {
                    l2=height[j];
                }
                int d=(i-j)*l2;
                if(d>max)
                    max=d;
            }
        }
        return max;
    }
}