[leetcode][two pointers] 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.

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