11. Container With Most Water (https://leetcode.com/problems/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, suc…

11. Container With Most Water (#1 Two Pointers).java

// Two pointer: begin/end pointers and move inward
// Time: O(n), 2ms
// Space: O(1), 39.9mb
class Solution {
    public int maxArea(int[] height) {
        int left = 0, right = height.length - 1;
        int max = 0;
        
        while(left < right) {
            max = Math.max(max, Math.min(height[left], height[right]) * (right - left));
            
            // Move the lower side inside (proof by contradiction)
            if(height[left] < height[right]) {
                left++;
            } else {
                right--;
            }
        }
        
        return max;
    }
}