Minimum Number of Moves to Seat Everyone LeetCode solution in Java

1
class Solution {
2
  public int minMovesToSeat(int[] seats, int[] students) {
3
    Arrays.sort(seats);
4
    Arrays.sort(students);
5
    int diff = 0;
6
    for (int i = 0; i < seats.length; i++) {
7
      diff += Math.abs(students[i] - seats[i]);
8
    }
9
    return diff;
10
  }
11
}