1011. 盛最多水的容器.cpp

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