力扣_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.
/*
给定n个非负整数a1，a2，…，an，其中每个表示坐标（i，ai）处的点。
绘制n条垂直线，使得线i的两个端点位于（i，ai）和（i，0）。
找到两条线，它们与x轴一起形成一个容器，这样容器就含有最多的水。
注意：您可能不会倾斜容器，n至少为2。
*/

解析

1.对两两进行求解，计算可以承载的水量。 然后不断更新最大值，最后返回最大值即可。 这种解法，需要两层循环，时间复杂度是O(n^2)
2.建立指向头尾的指针，每次移动一个指针，由此计算n,n-1…2个垂线内的水量，选取最大值

class Solution {
public:
	int maxArea(vector<int>& height) {
		int len = height.size();
		if (len < 2)
			return 0;
		int left = 0;
		int right = len - 1;
		int maxarea = 0;
		int temp;
		while (left<right){
			temp = (right - left)*min(height[right],height[left]);//数组代替指针
			if (temp>maxarea)
				maxarea = temp;
			if (height[right] > height[left])
				left++;
			else
				right--;
		}
		return maxarea;
	}
};