leetcode url

Solutions

int maxArea(vector<int> &height) {
	int left = 0;
	int right = height.size() - 1;
	if (height.size() < 2) {
		return 0;
	}
	int max_area = 0;
	while (left < right) {
		int area = min(height[left], height[right]) * (right - left);
		max_area = max(area, max_area);
		if (height[left] < height[right]) {
			++left;
		} else {
			--right;
		}
	}
	return max_area;
}