# LeetCode 11. Container With Most Water: C++ Solution

## Problem Statement

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.

```
Function Signature (C++):
int maxArea(vector<int>& height)
```

## TL;DR Code Solution

```
int maxArea(vector<int>& height) {
int left = 0;
int right = height.size() - 1;
int maxw = 0;
int minh = 0;
while (left < right) {
minh = min(height[left], height[right]);
maxw = max(maxw, minh * (right - left));
while (left < right && height[left] <= minh) left++;
while (left < right && height[right] <= minh) right--;
}
return maxw;
}
```