Code Ganker: Container With Most Water -- LeetCode

Code Ganker: Container With Most Water -- LeetCode: 原题链接: http://oj.leetcode.com/problems/container-with-most-water/ 首先一般我们都会想到brute force的方法，思路很简单，就是对每一对pair都计算一次容积，然后去最大的那个，总共有n*(n-1)/2对pa...