carloscn
commented
1 year ago Analysis
pub fn min_moves_to_seat(seats: Vec<i32>, students: Vec<i32>) -> i32
{
let mut ret:i32 = 0;
if seats.len() < 1 || students.len() != seats.len() {
return ret;
}
let mut seat_dup = seats.clone();
let mut stud_dup = students.clone();
seat_dup.sort();
stud_dup.sort();
for i in 0..seat_dup.len() {
ret += i32::abs(seat_dup[i] - stud_dup[i]);
}
return ret;
}
Description
There are n seats and n students in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat. You are also given the array students of length n, where students[j] is the position of the jth student.
You may perform the following move any number of times:
Increase or decrease the position of the ith student by 1 (i.e., moving the ith student from position x to x + 1 or x - 1) Return the minimum number of moves required to move each student to a seat such that no two students are in the same seat.
Note that there may be multiple seats or students in the same position at the beginning.
Example 1:
Input: seats = [3,1,5], students = [2,7,4] Output: 4 Explanation: The students are moved as follows:
Example 2:
Input: seats = [4,1,5,9], students = [1,3,2,6] Output: 7 Explanation: The students are moved as follows:
Example 3:
Input: seats = [2,2,6,6], students = [1,3,2,6] Output: 4 Explanation: Note that there are two seats at position 2 and two seats at position 6. The students are moved as follows:
Constraints:
n == seats.length == students.length 1 <= n <= 100 1 <= seats[i], students[j] <= 100