Given n non-negative integers height[0..n-1] where each represents a vertical line, find two lines that together with the x-axis form a container that holds the most water.