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 of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.
Example:
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
這個題目也是相當地經典,就是題目給定一陣列,陣列內為由左到右每個 ...... ㄜ,這裡就叫『木板』好了,每個木板的高度。
而不同的木板之間,距離單位都是 1。我們要做的就是,找出能讓容器積蓄最多的水兩片木板,最後,回傳可以積蓄水的最大值。
Read More »LeetCode: 11-Container With Most Water 解題紀錄