-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy paththird-maximum-number.go
More file actions
66 lines (59 loc) · 1.1 KB
/
Copy paththird-maximum-number.go
File metadata and controls
66 lines (59 loc) · 1.1 KB
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/third-maximum-number/
func thirdMax(nums []int) int {
const minVal = -2147483649
m := [3]int{minVal, minVal, minVal}
for _, i := range nums {
if i == m[0] || i == m[1] || i == m[2] {
continue
}
if i > m[0] {
m[0], m[1], m[2] = i, m[0], m[1]
} else if i > m[1] {
m[1], m[2] = i, m[1]
} else if i > m[2] {
m[2] = i
}
}
if m[2] == minVal {
return m[0]
}
return m[2]
}
func main() {
testCases := []struct {
nums []int
want int
}{
{
nums: []int{3, 2, 1},
want: 1,
},
{
nums: []int{1, 2},
want: 2,
},
{
nums: []int{2, 2, 3, 1},
want: 1,
},
}
successes := 0
for _, tc := range testCases {
x := thirdMax(tc.nums)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}