Module Expr Str Assign NameStore Str ClassDef bases body FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Num Assign NameStore BinOpSub Call NameLoad NameLoad Num Assign NameStore BinOpLShift Num Num While CompareLt NameLoad NameLoad body Assign NameStore BinOpMult Call NameLoad SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad BinOpSub NameLoad NameLoad Assign NameStore Call NameLoad NameLoad NameLoad If CompareLt SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad body AugAssignAdd NameStore Num orelse AugAssignSub NameStore Num Return NameLoad decorator_list decorator_list
N/A N/A 
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are
drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a
container, such that the container contains the most water.

Note: You may not slant the container.
 N/A __author__ Danyang Solution N/A N/A maxArea N/A N/A self height N/A N/A N/A 
        Two pointers scanning
        starting from two ends since x-coordinate is maximized

        Different from 041 Trapping Rain Water, since here it only considers two lines
        :param height: array
        :return: max area, integer
         N/A start 0 N/A end N/A N/A len height 1 N/A max_area N/A -1 32 N/A N/A start end N/A N/A area N/A N/A min N/A height N/A start N/A height N/A end N/A end start N/A max_area N/A max area max_area N/A N/A N/A height N/A start N/A height N/A end N/A N/A start 1 N/A N/A end 1 N/A max_area N/A N/A