LeetCode/go/minimum-number-of-moves-to-seat-everyone.go
Matej Focko d2ef757754
go: allow testing
Signed-off-by: Matej Focko <me@mfocko.xyz>
2024-06-16 11:44:08 +02:00

23 lines
354 B
Go

package main
import (
"slices"
)
func minMovesToSeat(seats []int, students []int) int {
abs := func(value int) int {
return max(-value, value)
}
// sort them to get minimal distances
slices.Sort(seats)
slices.Sort(students)
moves := 0
for i, seat := range seats {
student := students[i]
moves += abs(seat - student)
}
return moves
}