leetcode(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.

给定一个数组每个数代表一块木板的高度横坐标x的宽度代表木桶的宽度，求最大容积（木桶的高只能为两块木板的最低的那一个）
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

暴力法

遍历所有可能性，取最大值，time out超时，时间复杂度O(N^2)

class Solution {
public:
	int maxArea(vector<int>& height) {
		int length = height.size();
		int maxSum = 0;
		for (int i = 0; i < length; i++)
			for (int j = i + 1; j < length; j++)
				maxSum = max((j - i)*min(height[i], height[j]),maxSum);
		return maxSum;
	}

};

指针移动法

code2：假设第1块木板和最后一块组成的容积最大，如果还有更大的，那么小的木板往中心移，知道左边的木板位置等于右边模板的位置。
时间复杂度O(N)

class Solution {
public:
	int maxArea(vector<int>& height) {
		int end  = height.size() -1 ;
		int begin = 0;
		int maxSum = 0;
	
		maxSum = min(height[end], height[begin]) * (end - begin);
		while (begin < end) {
			if (height[begin] < height[end]) {

				begin++;
				maxSum = max(min(height[end], height[begin]) * (end - begin),maxSum);
			}
			else {
				end--;
				maxSum = max(min(height[end], height[begin]) * (end - begin), maxSum);

			
			
			}
			
		
		
		}

		return maxSum;
	}

};