feat: add solutions to lc problem: No.2037

No.2037.Minimum Number of Moves to Seat Everyone

Author: YangFong

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

@@ -145,6 +145,56 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minMovesToSeat(seats: number[], students: number[]): number {
+    seats.sort((a, b) => a - b);
+    students.sort((a, b) => a - b);
+    const n = seats.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        ans += Math.abs(seats[i] - students[i]);
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_moves_to_seat(mut seats: Vec<i32>, mut students: Vec<i32>) -> i32 {
+        seats.sort();
+        students.sort();
+        let n = seats.len();
+        let mut ans = 0;
+        for i in 0..n {
+            ans += (seats[i] - students[i]).abs();
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int minMovesToSeat(int *seats, int seatsSize, int *students, int studentsSize) {
+    qsort(seats, seatsSize, sizeof(int), cmp);
+    qsort(students, studentsSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 0; i < seatsSize; i++) {
+        ans += abs(seats[i] - students[i]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -133,6 +133,56 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minMovesToSeat(seats: number[], students: number[]): number {
+    seats.sort((a, b) => a - b);
+    students.sort((a, b) => a - b);
+    const n = seats.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        ans += Math.abs(seats[i] - students[i]);
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_moves_to_seat(mut seats: Vec<i32>, mut students: Vec<i32>) -> i32 {
+        seats.sort();
+        students.sort();
+        let n = seats.len();
+        let mut ans = 0;
+        for i in 0..n {
+            ans += (seats[i] - students[i]).abs();
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int minMovesToSeat(int *seats, int seatsSize, int *students, int studentsSize) {
+    qsort(seats, seatsSize, sizeof(int), cmp);
+    qsort(students, studentsSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 0; i < seatsSize; i++) {
+        ans += abs(seats[i] - students[i]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,13 @@
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int minMovesToSeat(int *seats, int seatsSize, int *students, int studentsSize) {
+    qsort(seats, seatsSize, sizeof(int), cmp);
+    qsort(students, studentsSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 0; i < seatsSize; i++) {
+        ans += abs(seats[i] - students[i]);
+    }
+    return ans;
+}

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

@@ -0,0 +1,12 @@
+impl Solution {
+    pub fn min_moves_to_seat(mut seats: Vec<i32>, mut students: Vec<i32>) -> i32 {
+        seats.sort();
+        students.sort();
+        let n = seats.len();
+        let mut ans = 0;
+        for i in 0..n {
+            ans += (seats[i] - students[i]).abs();
+        }
+        ans
+    }
+}

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

@@ -0,0 +1,10 @@
+function minMovesToSeat(seats: number[], students: number[]): number {
+    seats.sort((a, b) => a - b);
+    students.sort((a, b) => a - b);
+    const n = seats.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        ans += Math.abs(seats[i] - students[i]);
+    }
+    return ans;
+}