(贪心算法)
int min(int a, int b)
{return a > b ? b : a;
}
int max(int a, int b)
{
return a > b ? a : b;
}
int maxArea(int* height, int heightSize) {
int i, j, n;
i = 0;
j = heightSize - 1;
n = min(height[i], height[j]) * (j - i);
while(i < j)
{
if(height[i] < height[j])
{
++i;
n = max(n, min(height[i], height[j]) * (j - i));
}
else
{
--j;
n = max(n, min(height[i], height[j]) * (j - i));
}
}
return n;
}