-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminimum-number-of-moves-to-seat-everyone.go
72 lines (63 loc) · 1.19 KB
/
minimum-number-of-moves-to-seat-everyone.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package main
import (
"fmt"
"sort"
)
func abs(x int) int {
if x < 0 {
return -x
}
return x
}
func minMovesToSeat(seats []int, students []int) int {
ans := 0
sort.Ints(seats)
sort.Ints(students)
for i := range students {
ans += abs(seats[i] - students[i])
}
return ans
}
func main() {
testCases := []struct {
seats []int
students []int
want int
}{
{
seats: []int{12, 14, 19, 19, 12},
students: []int{19, 2, 17, 20, 7},
want: 19,
},
{
seats: []int{3, 1, 5},
students: []int{2, 7, 4},
want: 4,
},
{
seats: []int{4, 1, 5, 9},
students: []int{1, 3, 2, 6},
want: 7,
},
{
seats: []int{2, 2, 6, 6},
students: []int{1, 3, 2, 6},
want: 4,
},
}
successes := 0
for _, tc := range testCases {
x := minMovesToSeat(tc.seats, tc.students)
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)
}
}