LeetCode-11-Container With Most Water(证明)-Medium

class Solution {
public:
int maxArea(vector<int>& height) {
int maxContainer=0;
int vSize=height.size();

int left=0;
int right=vSize-1;

while(left<right){
int t=min(height[left], height[right])*(right-left);
if(t>maxContainer){
maxContainer=t;
}

if(height[left]<height[right]){
left++;
}else{
right--;
}
}

return maxContainer;
}
};