算法7月-O(n) 解決算法問題 最大存水量的 問題 Leetcode11- 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 of line i is at (i, ai) and (i, 0). Find two

>>阅读原文<<