LeetCode: Container With Most Wate

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.

解析：对于每组容器的容量f(i,j)，能够得到比f(i,j)更大容量的可能，只有提高最短边的高。

class Solution {
public:
    int min(int a, int b) {
        if (a < b) return a;
        else return b;
    }
    
    int max(int a, int b) {
        if (a > b) return a;
        else return b;
    }
    
    int maxArea(vector<int>& height) {
        int ans = 0;
        
        int i = 0, j = height.size() - 1;
        while (i < j)
        {
            int t = (j - i) * min(height[i], height[j]);
            ans = max(ans, t);
            
            if (height[i] >= height[j]) {
                j--;
            }
            else {
                i++;
            }
        }
        
        
        return ans;
    }
};