Package g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone

Class Solution

java.lang.Object

g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone.Solution

public class Solution
extends Object

2037 - Minimum Number of Moves to Seat Everyone.<p>Easy</p> <p>There are <code>n</code> seats and <code>n</code> students in a room. You are given an array <code>seats</code> of length <code>n</code>, where <code>seats[i]</code> is the position of the <code>i^th</code> seat. You are also given the array <code>students</code> of length <code>n</code>, where <code>students[j]</code> is the position of the <code>j^th</code> student.</p> <p>You may perform the following move any number of times:</p> <ul> <li>Increase or decrease the position of the <code>i^th</code> student by <code>1</code> (i.e., moving the <code>i^th</code> student from position <code>x</code> to <code>x + 1</code> or <code>x - 1</code>)</li> </ul> <p>Return <em>the <strong>minimum number of moves</strong> required to move each student to a seat</em> <em>such that no two students are in the same seat.</em></p> <p>Note that there may be <strong>multiple</strong> seats or students in the <strong>same</strong> position at the beginning.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> seats = [3,1,5], students = [2,7,4]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong></p> <p>The students are moved as follows:</p> <ul> <li> <p>The first student is moved from from position 2 to position 1 using 1 move.</p> </li> <li> <p>The second student is moved from from position 7 to position 5 using 2 moves.</p> </li> <li> <p>The third student is moved from from position 4 to position 3 using 1 move.</p> </li> </ul> <p>In total, 1 + 2 + 1 = 4 moves were used.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> seats = [4,1,5,9], students = [1,3,2,6]</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong></p> <p>The students are moved as follows:</p> <ul> <li> <p>The first student is not moved.</p> </li> <li> <p>The second student is moved from from position 3 to position 4 using 1 move.</p> </li> <li> <p>The third student is moved from from position 2 to position 5 using 3 moves.</p> </li> <li> <p>The fourth student is moved from from position 6 to position 9 using 3 moves.</p> </li> </ul> <p>In total, 0 + 1 + 3 + 3 = 7 moves were used.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> seats = [2,2,6,6], students = [1,3,2,6]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> Note that there are two seats at position 2 and two seats at position 6.</p> <p>The students are moved as follows:</p> <ul> <li> <p>The first student is moved from from position 1 to position 2 using 1 move.</p> </li> <li> <p>The second student is moved from from position 3 to position 6 using 3 moves.</p> </li> <li> <p>The third student is not moved.</p> </li> <li> <p>The fourth student is not moved.</p> </li> </ul> <p>In total, 1 + 3 + 0 + 0 = 4 moves were used.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == seats.length == students.length</code></li> <li><code>1 <= n <= 100</code></li> <li><code>1 <= seats[i], students[j] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minMovesToSeat(int[] seats, int[] students)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minMovesToSeat

public int minMovesToSeat(int[] seats,
 int[] students)