题目
C++ solution
class Solution {
public:
int maxArea(vector<int>& height) {
int len = height.size();
int max_area = 0;
for (int i = 0; i < len - 1; ++i)
{
for (int j = i + 1; j < len; ++j)
{
int small = height[i] < height[j] ? height[i] : height[j];
int area = small * (j - i);
if (area > max_area)
{
max_area = area;
}
}
}
return max_area;
}
};
简要题解
采用暴力解题法,直接遍历任意两条垂直线组成的容器,找出这些容器的容量的最大值。