leetcode——Container With Most Water

题目：

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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<int>& height) {
       int i = 0, j = height.size() - 1;//维护两个指针，分别向中间靠拢，更新最大面积
       int max_area = 0;
       while (i < j) 
       {
           int area = (j - i) * min(height[i], height[j]);
           max_area = max(area, max_area);
           if (height[i] < height[j])//每次更新较短的线段，因为更新较大的线段必然造成面积变小
           {
               ++i;
           }
           else
           {
               --j;
           }
       }
       return max_area;
    }
};