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 and n is at least 2.
给出一系列a(i),任意两个(i, ai) and (i, 0) 和x轴组成的u型矩形面积最大，u型的两边长度可能不一致，所装容量为短板边长决定