public class Solution {
public int minMoves2(int[] nums) {
Arrays.sort(nums);
int l = nums.length;
int median = nums[l / 2];
int moves = 0;
for (int i = 0; i < l; i++) moves += (int)Math.abs(nums[i] - median);
return moves;
}
}
LeetCode 462. Minimum Moves to Equal Array Elements II
最新推荐文章于 2024-02-02 17:27:06 发布