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.

class Solution {
public:
   int maxArea(vector<</span>int>& height) {
       int n = height.size();
       int l = 0, r = n - 1;
       int m = min(height[l], height[r]);
       int i = 0;
       int sum = m * (r - l);
       while(l <</span> r){
           if(m==height[r]) {
               i = r - 1;
               while(l <</span> i && height[r] >= height[i]) --i;
               r = i;
           }
           else{
               int i = l + 1;
               while(i <</span> r && height[l] >= height[i]) ++i;
               l = i;
           }

           m = min(height[l], height[r]);
           int tmp = m * (r - l);
           if(tmp > sum) sum = tmp;
       }
       return sum;
   }
};