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.

Classical two pointers problem

#include <vector>
#include <climits>
#include <iostream>
using namespace std;

int containMostWater(vector<int>& height) {
if(height.size() <= 1) return 0;
int i = 0;
int j = height.size() - 1;
int maxWater = 0;
while(i < j) {
int minHeight = min(height[i], height[j]);
maxWater = max(maxWater, minHeight * (j - i));
if(height[i] > height[j]) j--;
else i++;
}
return maxWater;
}

int main(void) {
vector<int> height{2, 3, 4, 3, 2};
int maxWater = containMostWater(height);
cout << maxWater << endl;
}