Leecode #11 Container With Most Water

一、 问题描述
Leecode第十一题，题目为：
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.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

问题理解为：

找到最大值

二、解题思路

逐个字符匹配

三、实现代码

class Solution {
public:
    int maxArea(vector<int>& height) {
        int area = 0;
        int i = 0, j = height.size() - 1;
        while(i < j){
            int h = min(height[i],height[j]);
            area = max(area,(j - i) * h);
            while(height[i] <= h && i < j)  i++;
            while(height[j] <= h && i < j)  j--;
        }
        return area;
    }
};

``