双指针：盛最多水的容器（4.18leetcode每日一题）

 1 int maxArea(vector<int>& height) 
 2     {
 3         int res = 0;
 4         int i = 0;
 5         int j = height.size()-1;
 6 
 7         while(i < j)
 8         {
 9             int area = (j-i) * min(height[i],height[j]);
10             res = max(area,res);
11             if(height[i] < height[j])
12             {
13                 i++;
14             }
15             else
16             {
17                 j--;
18             }
19         }
20         return res;
21     }