leetcode 11. Container With Most Water

题目链接

思路：暴力枚举，时间复杂度O(N^2),空间复杂度O(1)

AC代码：

int  min(int a,int b)
{
    return a>b ? b:a;
}
int maxArea(int* height, int heightSize) {
    int ans = 0;
    for(int i = 0;i < heightSize;i++)
    {
        for(int j = i + 1; j < heightSize;j++)
        {
            if(min(height[i],height[j])*(j-i)>ans)
            {
                ans = min(height[i],height[j])*(j-i);
            }
        }
    }
    return ans;
}