Leetcode 11. Container With Most Water

題目： 給定一個數組，數組下標作爲橫軸，對應的數值作爲縱軸，求兩個縱軸之間能裝的最大雨水量。 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

>>阅读原文<<