装最多水的容器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.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

我们需要定义i和j两个指针分别指向数组的左右两端，然后两个指针向中间搜索，每移动一次算一个值和结果比较取较大的，容器装水量的算法是找出左右两个边缘中较小的那个乘以两边缘的距离。

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

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

int main(){
	std::vector<int> num={1,8,6,2,5,4,8,3,7};
	Solution S;
	cout << S.maxArea(num);
	return 0;
}

参考网址：
http://www.cnblogs.com/grandyang/p/4455109.html
https://leetcode.com/problems/container-with-most-water/