1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public int minMoves2(int[] nums) {
Arrays.sort(nums);
int moves = 0;
int midNum = nums[nums.length / 2];
for (int num : nums) {
moves += Math.abs(num - midNum);
}
return moves;
}
}
|
References
462. Minimum Moves to Equal Array Elements II