---
tags: LeetCode,Top 100 Liked Questions
---
# 11. Container With Most Water
https://leetcode.com/problems/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 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.

Notice that you may not slant the container.
## Example
Example 1:

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.

Example 2:

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

Example 3:

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

## 解題想法
### 1.

int maxArea(vector<int> &height)
{
    int i = 0, j = height.size() - 1;
    int maxarea = 0;
    while (i < j)
    {
        int newarea = min(height[i], height[j]) * (j - i);
        maxarea = max(newarea, maxarea);
        if (height[i] < height[j])//往小的那邊縮area才有可能變大
        {
            i++;
        }
        else
        {
            j--;
        }
    }
    return maxarea;
}

時間複雜度為O(N)