[Golang][Leetcode][Array]刷題系列-11-Two Pointers

2021-05-29 237 words 2 minutes

Contents

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.

Example :

Note

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.

以下是我自己的解法 - O(n)

Runtime: 80 ms, faster than 93.68% of Go online submissions for Container With Most Water.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
func maxArea(height []int) int {
    
    max, start, end := 0, 0, len(height)-1
    
    var high, width, temp int
    
    for start < end {
        
        width = end - start
        
        if height[start] < height[end] {
            
            high = height[start]
            
            start++
        
        }else {
            
            high = height[end]
            
            end--
        }
       
        temp = width * high
       
        if temp > max {
            
            max = temp
        }
    }
    
    return max
}

最後祝福努力認真的各位 “All your dream of are hidden in your daily life” 我們峰頂見!!!