Challenge Statement
- You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
- Find two lines that together with the x-axis, form a container, such that the container contains the most water.
- Return the maximum amount of water a container can store.
- This challenge corresponds to LeetCode #11.
Constraints
n == len(height)2 <= n <= 1050 <= height[i] <= 104
Example 1:
Input: height = [1, 8, 6, 2, 5, 4, 8, 3, 7]
Output: 49
Explanation: The above vertical lines are represented by the array [1, 8, 6, 2, 5, 4, 8, 3, 7]. In this case, the max area of water the container can contain is 49.
Example 2:
Input: height = [1,1]
Output: 1
Solution
Below is my solution and some test cases. This solution has a linear time complexity O(n) and a constant space complexity O(1), where n is the length of the input list.
