11. Container With Most Water(装最多的水 双指针)

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

l = 0

r = n-1

a[l] <a[r]

l++

那边矮扔掉哪边

 class Solution {
 public:
     int maxArea(vector<int>& a) {
         const int n = a.size();
         int res = ;
         int low = ;
         int high = n-;
         while(low<=high) {
             res = std::max((high-low)*std::min(a[low],a[high]),res);
             if(a[low]<a[high]) {
                 low++;
             } else {
                 high--;
             }
         }
         return res;
     }
 };

 class Solution:
     def maxArea(self, a):
         """
         :type height: List[int]
         :rtype: int
         """
         maxArea = 0
         l = 0
         r = len(a) - 1
         while(l<r):
             maxArea = max(maxArea,min(a[l],a[r])*(r-l))
             if(a[l]<a[r]):
                 l+=1
             else :
                 r-=1
         return maxArea