add sol 2037

Author: ductnn

leetcode/topic/sorting/2037/sol.go

@@ -0,0 +1,34 @@
+// https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/description
+
+package main
+
+import (
+	"fmt"
+	"sort"
+)
+
+func minMovesToSeat(seats []int, students []int) int {
+	sort.Ints(seats)
+	sort.Ints(students)
+
+	total := 0
+	for i := range len(seats) {
+		total += abs(seats[i] - students[i])
+	}
+
+	return total
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
+
+func main() {
+	seats := []int{4, 1, 5, 9}
+	students := []int{1, 3, 2, 6}
+
+	fmt.Println(minMovesToSeat(seats, students))
+}

leetcode/topic/sorting/2037/sol.py

@@ -0,0 +1,18 @@
+from typing import List
+
+class Solution:
+    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
+        seats.sort()
+        students.sort()
+
+        total = 0
+        for i in range(len(seats)):
+            total += abs(seats[i] - students[i])
+        
+        return total
+    
+if __name__ == "__main__":
+    solution = Solution()
+    seats = [4, 1, 5]
+    students = [2, 7, 3]
+    print(solution.minMovesToSeat(seats, students))