leetcode: Container With Most Water

cwmw.cpp

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