leetcode/11_container_with_most_water/main.cpp

#include <bits/stdc++.h>
using namespace std;

class Solution {
   public:
    int maxArea(vector<int>& heights) {
        int result = 0;
        int l = 0, r = heights.size() - 1;

        while (l != r) {
            result = max(result, (r - l) * min(heights[l], heights[r]));
            if (heights[l] <= heights[r]) {
                l++;
            } else {
                r--;
            }
        }

        return result;
    }
};