盛水最多的容器

   [题目](https://leetcode-cn.com/problems/container-with-most-water/)

暴力法：

class Solution {
public:
    int maxArea(vector<int>& height) {
        int volumn=0;
        int len=height.size();
        for(int i=0;i<len;i++)
        for(int j=i+1;j<len;j++){
        int temp=(j-i)*min(height[i],height[j]);
        if(temp>volumn)  volumn=temp;
        }
        return volumn;
    }
};

改进版：

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