Maximum Water Capacity

You are given an array of non-negative integers heights, where each heights[i] represents the height of a vertical wall at position i. Find two walls which together along with the base forms a container, such that the container contains the most water. Return the area of water it can contain.