11. 坐标轴容器盛水问题

最新推荐文章于 2021-07-02 00:09:40 发布

ambihan

最新推荐文章于 2021-07-02 00:09:40 发布

阅读量613

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/ambihan/article/details/39829727

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

任意取两条线与x坐标轴构成容器的最大容量

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
	int maxArea(vector<int> &height) {
		if (height.empty()) return 0;
		int Area = 0;
		int i = 0, j = height.size() - 1;
		while (i < j)
		{
			if (height[i] <= height[j])
			{
				if (height[i] * (j - i) > Area) Area = height[i] * (j - i);
				++i;
			}
			else
			{
				if (height[j] * (j - i) > Area) Area = height[j] * (j - i);
				--j;
			}
		}
		return Area;
	}
};

int main()
{
	int n;
	Solution so;
	while (cin >> n)
	{
		vector<int> height(n);
		for (int i = 0; i < n; ++i) cin >> height[i];
		cout << so.maxArea(height) << endl;
	}
	return 0;
}

考虑所有线条相互干扰时，取两条线与x坐标轴构成容器的最大容量

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
	int maxArea(vector<int> &height) {
		if (height.empty()) return 0;
		int maxHeight = 0, Area = 0;
		for (int i = 1; i < height.size(); ++i)
		if (height[i] > height[maxHeight]) maxHeight = i;
		for (int i = 0; i < maxHeight;)
		{
			int j = i;
			while (i < maxHeight && height[i] <= height[j]) ++i;
			if (height[j] * (i - j) > Area) Area = height[j] * (i - j);
		}
		for (int i = height.size() - 1; i > maxHeight;)
		{
			int j = i;
			while (i > maxHeight && height[i] <= height[j]) --i;
			if (height[j] * (j - i) > Area) Area = height[j] * (j - i);
		}
		return Area;
	}
};

int main()
{
	int n;
	Solution so;
	while (cin >> n)
	{
		vector<int> height(n);
		for (int i = 0; i < n; ++i) cin >> height[i];
		cout << so.maxArea(height) << endl;
	}
	return 0;
}