[Leetcode] #11 Container With Most Water

Discription:

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.

Solution:

//暴力搜索  超时 时间复杂度O(N^2)
int maxArea(vector<int>& height) {
	int area = 0;
	for (int i = 0; i < height.size() - 1; ++i){
		for (int j = i + 1; j < height.size(); ++j){
			int temp = min(height[i], height[j])*(j - i);
			if (temp>area)
				area = temp;
		}
	}
	return area;
}

//头尾往中间移  较短的一边先移  移到比自己大的边  O(N)
int maxArea(vector<int>& height) {   
	int i = 0, j = height.size() - 1;
	int area = 0;
	while (i < j){
		int temp = min(height[i], height[j])*(j - i);
		if (temp>area)
			area = temp;
		if (height[i] < height[j])
			++i;
		else
			--j;
	}
	return area;
}

附：Leetcode源代码见我的GitHub