[LeetCode]11. Container With Most Water（自学留存）

_syntax_error_

于 2018-03-10 23:22:15 发布

阅读量148

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Ada_who/article/details/79512944

本文介绍了一种寻找由两条垂直线和x轴形成的能容纳最多水的容器的方法。通过两端向中间逼近，每次移动较短边对应的指针，记录过程中遇到的最大面积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Personal Tips: 从两端移动，移动高度短的一段，记录最大面积。代码如下：

class Solution
{
public:
	int maxArea(vector<int>&height) {
		if (height.size()<2) return 0;
		int i = 0, j = height.size() - 1, start = i, end = j, max = min(height[i], height[j])*(j - i);
		while (i<j-1)
		{			
			height[i] < height[j] ? ++i : --j;
			max = (max > (min(height[i], height[j])*(j - i)) ? max : (min(height[i], height[j])*(j - i)));
		}
		return max;
	}
};