1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-19 17:56:55 +02:00
LeetCode/go/minimum-number-of-moves-to-seat-everyone.go
2024-06-13 13:04:30 +02:00

23 lines
390 B
Go

package minimum_number_of_moves_to_seat_everyone
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
}