11. Container With Most Water
Level : Medium
原題連結 : Click
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.
Input: height = [1,8,6,2,5,4,8,3,7]
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.
以下是我自己的解法 - O(n)
Runtime: 80 ms, faster than 93.68% of Go online submissions for Container With Most Water.
最後祝福努力認真的各位 “All your dream of are hidden in your daily life” 我們峰頂見!!!