[LeetCode]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 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.

解题方案：

遍历所有方案，找到最大值。下面是该题的代码：

class Solution {
public:
    int maxArea(vector<int> &height) {
        int maxAre = 0;
        int area = 0;
        int len = height.size();
        int left = 0;
        int right = len -1;
        while(left < right){
            int high = height[left] > height[right]? height[right]:height[left];
            area = high * (right - left);
            if(area > maxAre){
                maxAre = area;
            }else if(height[left] > height[right]){
                right--;
            }else {
                left++;
            }
            
        }
        return maxAre;
    }
};