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.

class Solution {
public:
    int maxArea(vector<int>& height) {
        int water = 0, n = height.size();
        for(int i = 0, j = n-1; i < j; ){
           int h = min(height[i], height[j]);
           water = max(water, (j-i) * h);
           while(height[i] <= h && i < j) i++;  //在i增大和j减小的时候什么时候可能water更大？ 只有height[i]/height[j]比h更大的时候
           while(height[j] <= h && i < j) j--;
        }
        return water;
        
    }
};