Leetcode 11. Container With Most Water (Medium) (cpp)

Leetcode 11. Container With Most Water (Medium) (cpp)

Tag: Array, Two Pointers

Difficulty: Medium

/*

11. Container With Most Water (Medium)

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.

*/
class Solution {
public:
	int maxArea(vector<int>& height) {
		int water = 0, i = 0, j = height.size() - 1;
		while (i < j) {
			int h_min = min(height[i], height[j]);
			water = max(water, h_min * (j - i));
			while (height[j] <= h_min && i < j) {
                j--;
            }
            while (height[i] <= h_min && i < j) {
                i++;
            }
        }
        return water;
    }
};