> For the complete documentation index, see [llms.txt](https://yingzehou.gitbook.io/docs/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://yingzehou.gitbook.io/docs/leetcode/array/container-with-most-water.md).

# Container with most water

ID: 11

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 the line `i` is at `(i, ai)` and `(i, 0)`. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg)

```
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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.
```

## Idea

{% hint style="info" %}
Two pointers
{% endhint %}

left=0, right=length-1; 

getArea for each left--right pair, left++ if height\[left]\<height\[right], otherwise right++

## Code

```java
public int maxArea(int[] height) {
        int left = 0;
        int right = height.length-1;
        
        int max = 0;
        while(left<right){
            if(getArea(height, left, right)>max){
                max = getArea(height, left, right);    
            }
            if(height[left]<height[right]){
                left++;
            }
            else{
                right--;
            }
        }
        
        return max;
    }
    
    private int getArea(int[] height, int left, int right){
        int h = height[left]<height[right]?height[left]:height[right];
        int w = right-left;
        return h*w;
    }
```