# Leetcode 11. 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.

## Solution：

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

• 评论

• 上一篇