2017-11-07 21:58:22
https://leetcode.com/problems/container-with-most-water/description/
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 and n is at least 2.
翻译:给定n个非负整数a1,a2,...,an,其中每个代表坐标(i,ai)处的一个点。 绘制n条垂直线,线i的两个端点是(i,ai)和(i,0)。 找到两条线,它们与x轴一起形成一个容器,使得容器包含最多的水。(类似于:木桶盛水的高度取决于最短的那块木板-)
丑丑画个图:
如[ a1, a2, a3],对于a1,a3,Area就是红色部分面积,最短边(选择a1,a3较短的一个边)乘上底边(底边就是坐标距离)
int maxArea(int* height, int heightSize) {
int area = 0;
for(int i = 0; i < heightSize - 1; i++){
for(int j = heightSize - 1; j > i ; j--){ //从后向前,若后边某个height大于height[i],那么要采用的高度是height[i],且此时因为j-i肯定大于j--之后的j - i
if(height[j] >= height[i]){
if(height[i] * (j - i) > area)
area = height[i] * (j - i);
break;
}
if(height[j] * (j - i) > area) area = height[j] * (j - i);
}
}
return area;
}
2017-11-08 18:53:03