462. Minimum Moves to Equal Array Elements II 最小移动到等数组元素II

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

You may assume the array's length is at most 10,000.

Example:

Input:
[1,2,3]

Output:
2

Explanation:
Only two moves are needed (remember each move increments or decrements one element):

[1,2,3]  =>  [2,2,3]  =>  [2,2,2]

给定非空整数数组，找到使所有数组元素相等所需的最小移动数，移动将所选元素递增1或将所选元素递减1。

/**
 * @param {number[]} nums
 * @return {number}
 */
var minMoves2 = function(nums) {
    let newNums = nums.sort((a,b)=>{return a-b});
    let mid = nums[parseInt(newNums.length / 2)];
    let sum = 0;
    for(let i in newNums){
        sum += Math.abs(newNums[i] - mid);
    }
    return sum;
};

来自为知笔记(Wiz)