-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathheight-checker.go
58 lines (52 loc) · 1007 Bytes
/
height-checker.go
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
package main
import (
"fmt"
"sort"
)
// source: https://leetcode.com/problems/height-checker/
func heightChecker(heights []int) int {
hs := make([]int, len(heights))
copy(hs, heights)
sort.Ints(hs)
var ans int
for i := range hs {
if hs[i] != heights[i] {
ans++
}
}
return ans
}
func main() {
testCases := []struct {
heights []int
want int
}{
{
heights: []int{1, 1, 4, 2, 1, 3},
want: 3,
},
{
heights: []int{5, 1, 2, 3, 4},
want: 5,
},
{
heights: []int{1, 2, 3, 4, 5},
want: 0,
},
}
successes := 0
for _, tc := range testCases {
x := heightChecker(tc.heights)
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)
}
}