## 11. Container With Most Water

Given `n`

non-negative integers `a`

_{1}, a_{2}, ..., a_{n}_{ }, where each represents a point at coordinate `(i, a`

. _{i})`n`

vertical lines are drawn such that the two endpoints of the line `i`

is at `(i, a`

and _{i})`(i, 0)`

. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

**Notice** that you may not slant the container.

**Example 1:**

Input:height = [1,8,6,2,5,4,8,3,7]Output:49Explanation:The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

**Example 2:**

Input:height = [1,1]Output:1

**Example 3:**

Input:height = [4,3,2,1,4]Output:16

**Example 4:**

Input:height = [1,2,1]Output:2

**Constraints:**

`n == height.length`

`2 <= n <= 3 * 10`

^{4}`0 <= height[i] <= 3 * 10`

^{4}

## Rust Solution

```
struct Solution;
impl Solution {
fn max_area(height: Vec<i32>) -> i32 {
let mut max = 0;
let mut l = 0;
let mut r = height.len() - 1;
while l < r {
max = i32::max(i32::min(height[l], height[r]) * (r - l) as i32, max);
if height[l] < height[r] {
l += 1;
} else {
r -= 1;
}
}
max
}
}
#[test]
fn test() {
let height = vec![1, 8, 6, 2, 5, 4, 8, 3, 7];
assert_eq!(Solution::max_area(height), 49);
}
```

Having problems with this solution? Click here to submit an issue on github.