题目链接:https://leetcode-cn.com/problems/container-with-most-water/
题目如下:
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;
}
};