力扣-11题盛最多水的容器（C++）- 双指针+有价值

偏执的太偏执、 2022-08-28 11:41 154阅读 0赞

题目链接：[https://leetcode-cn.com/problems/container-with-most-water/][https_leetcode-cn.com_problems_container-with-most-water]  
题目如下：  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_20_color_FFFFFF_t_70_g_se_x_16]  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_20_color_FFFFFF_t_70_g_se_x_16 1]

class Solution {
        
    public:
        int maxArea(vector<int>& height) {
        
            //双指针法：两边向中间收缩
            //1、每次以较短的指针作为容器高*双指针宽度=当前的最大容量
            //2、依次比较是否为最大的即可
            int left=0,right=height.size()-1;
            int real_height,flag_shrink;//真实高度;收缩位置标识符
            int max=0,capacity;
    
            while(left<right){
        
                if(height[left]>height[right]) {
        real_height=height[right];flag_shrink=1;}//右边收缩
                else {
        real_height=height[left];flag_shrink=-1;}//左边收缩
    
                capacity=real_height*(right-left);
                if(capacity>max) max=capacity;
    
                if(flag_shrink==1) right--;
                else left++;
            }
    
            return max;
        }
    };

[https_leetcode-cn.com_problems_container-with-most-water]: https://leetcode-cn.com/problems/container-with-most-water/
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_20_color_FFFFFF_t_70_g_se_x_16]: /images/20220828/0f21292f8b8c457682c80f73bf4cf69d.png
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBASkluZ2xlczEyMw_size_20_color_FFFFFF_t_70_g_se_x_16 1]: /images/20220828/8ce07dfd97694c6b9561b31f6d7df695.png