[leetcode]11.盛最多水的容器（Container With Most Water ）C++代码实现

1，题目描述

2，题目分析

贪心法

3，代码实现

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