feat: add solutions to lc problem: No.2037

No.2037.Minimum Number of Moves to Seat Everyone

Author: yanglbme

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/README.md

@@ -76,15 +76,66 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
+        seats.sort()
+        students.sort()
+        return sum(abs(seats[i] - students[i]) for i in range(len(seats)))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minMovesToSeat(int[] seats, int[] students) {
+        Arrays.sort(seats);
+        Arrays.sort(students);
+        int ans = 0;
+        for (int i = 0; i < seats.length; ++i) {
+            ans += Math.abs(seats[i] - students[i]);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minMovesToSeat(vector<int>& seats, vector<int>& students) {
+        sort(seats.begin(), seats.end());
+        sort(students.begin(), students.end());
+        int ans = 0;
+        for (int i = 0; i < seats.size(); ++i)
+            ans += abs(seats[i] - students[i]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minMovesToSeat(seats []int, students []int) int {
+	sort.Ints(seats)
+	sort.Ints(students)
+	ans := 0
+	for i := range students {
+		ans += abs(seats[i] - students[i])
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x >= 0 {
+		return x
+	}
+	return -x
+}
 ```
 
 ### **...**

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/README_EN.md

@@ -71,13 +71,64 @@ In total, 1 + 3 + 0 + 0 = 4 moves were used.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
+        seats.sort()
+        students.sort()
+        return sum(abs(seats[i] - students[i]) for i in range(len(seats)))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minMovesToSeat(int[] seats, int[] students) {
+        Arrays.sort(seats);
+        Arrays.sort(students);
+        int ans = 0;
+        for (int i = 0; i < seats.length; ++i) {
+            ans += Math.abs(seats[i] - students[i]);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minMovesToSeat(vector<int>& seats, vector<int>& students) {
+        sort(seats.begin(), seats.end());
+        sort(students.begin(), students.end());
+        int ans = 0;
+        for (int i = 0; i < seats.size(); ++i)
+            ans += abs(seats[i] - students[i]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minMovesToSeat(seats []int, students []int) int {
+	sort.Ints(seats)
+	sort.Ints(students)
+	ans := 0
+	for i := range students {
+		ans += abs(seats[i] - students[i])
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x >= 0 {
+		return x
+	}
+	return -x
+}
 ```
 
 ### **...**

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int minMovesToSeat(vector<int>& seats, vector<int>& students) {
+        sort(seats.begin(), seats.end());
+        sort(students.begin(), students.end());
+        int ans = 0;
+        for (int i = 0; i < seats.size(); ++i)
+            ans += abs(seats[i] - students[i]);
+        return ans;
+    }
+};

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/Solution.go

@@ -0,0 +1,16 @@
+func minMovesToSeat(seats []int, students []int) int {
+	sort.Ints(seats)
+	sort.Ints(students)
+	ans := 0
+	for i := range students {
+		ans += abs(seats[i] - students[i])
+	}
+	return ans
+}
+
+func abs(x int) int {
+	if x >= 0 {
+		return x
+	}
+	return -x
+}

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int minMovesToSeat(int[] seats, int[] students) {
+        Arrays.sort(seats);
+        Arrays.sort(students);
+        int ans = 0;
+        for (int i = 0; i < seats.length; ++i) {
+            ans += Math.abs(seats[i] - students[i]);
+        }
+        return ans;
+    }
+}

solution/2000-2099/2037.Minimum Number of Moves to Seat Everyone/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
+        seats.sort()
+        students.sort()
+        return sum(abs(seats[i] - students[i]) for i in range(len(seats)))