Container With Most Water

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 that holds the most water.

• Implement a function that takes height (array of non-negative integers).
• Return the maximum amount of water a container can store.