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.
Note: You may not slant the container.
n == height.length2 <= n <= 10^50 <= height[i] <= 10^4height = [1,8,6,2,5,4,8,3,7]49height = [1,1]1