[leetcode---双指针]盛最多水的容器

https://leetcode-cn.com/problems/container-with-most-water/
数组为 [1,8,6,2,5,4,8,3,7] ，答案为49

'''12ms-------O(n)'''
'''双指针'''
'''乘积依赖距离和边长，距离肯定会缩小，除非边长更大，才有可能使最后结果更大'''
'''因此让边长小的指针移动,边长大的指针不动'''
class Solution {
public:
    int maxArea(vector<int>& height) {
        int i = 0, j = height.size() - 1, maxn= 0;
        while(i < j){
            maxn= max(maxn, min(height[i], height[j]) * (j - i));
            if(height[i] < height[j]) i++;
            else j--;
        }
        return maxn;
    }
};

'''608ms-------O(n log(n))'''
'''三指针'''
'''类似快排，以当前值为边长，向两边搜索最大的距离'''
class Solution {
public:
    int maxArea(vector<int>& height) {
        int i = 0, j = height.size() - 1,maxn = 0;
        for(int i = 0;i <= j; i++){            
            int l = 0, mid = i, r = j;
            while(mid < r && height[mid] > height[r]){
                r--;
            }
            while(l < mid && height[mid] > height[l]){                
                l++;
            }
            maxn = max(maxn,height[i] * (r - l));
        }
        return maxn;
    }
};