LeetCode 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.

方法：对撞指针

class Solution {
public:
    int maxArea(vector<int>& height) {
        assert(height.size() >= 2);
        int i = 0,j = height.size()-1;
        int maxium = 0;
        int minEndPoint;
        while (i < j)
        {
            if (height[i] >= height[j]) minEndPoint = height[j];
            else minEndPoint = height[i];
            if ((j - i)*minEndPoint > maxium) maxium = (j - i)*minEndPoint;
            if (height[i] >= height[j]) j --;
            else i ++;
        }
        return maxium;
    }
};