Minimum Moves to Equal Array Elements II LeetCode solution in Java

1
class Solution {
2
  public int minMoves2(int[] nums) {
3
    Arrays.sort(nums);
4
    int idx = (nums.length - 1) / 2;
5
    int sum = 0;
6
    for (int i = 0; i < nums.length; i++) {
7
      sum += Math.abs(nums[i] - nums[idx]);
8
    }
9
    return sum;
10
  }
11
}