盛最多水的容器---双指针

目录

一：题目

二：算法原理讲解

三：代码编写

---

一：题目

题目链接：https://leetcode.cn/problems/container-with-most-water/description/

二：算法原理讲解

三：代码编写

class Solution {
public:
    int maxArea(vector<int>& height) 
    {
        int ret = 0;
        int left = 0,right = height.size() -1 ;

        while(left <= right)
        {
            int v = min(height[left], height[right]) * (right - left);
            ret = max(ret,v);

            //移动指针，谁小移动谁
            if(height[left] > height[right]) right--;
            else left++;
        }

        return ret;
    }
};