11. 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 and n is at least 2.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:
Input: [1,8,6,2,5,4,8,3,7] Output: 49
题目大意
给出n个有序的长度序列,将这些长条组成木桶,木桶高度由两端中较小的一端决定,容积 = min(左端长度, 右端长度) * (右端 - 左端)
解题思路(待优化)
根据左右两端的间距遍历,求出最大容积
AC代码(待优化)
class Solution {
public:
int maxArea(vector<int>& height) {
int MAX = 0;
for(int i = height.size() - 1; i > 0; i--) {
for(int j = 0; j + i < height.size(); j++) {
int h = min(height[j], height[j + i]);
if(h * i > MAX) MAX = h * i;
}
}
return MAX;
}
};