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

Posted Long Long Journey

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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。
  1. /**
  2. * @param {number[]} nums
  3. * @return {number}
  4. */
  5. var minMoves2 = function(nums) {
  6. let newNums = nums.sort((a,b)=>{return a-b});
  7. let mid = nums[parseInt(newNums.length / 2)];
  8. let sum = 0;
  9. for(let i in newNums){
  10. sum += Math.abs(newNums[i] - mid);
  11. }
  12. return sum;
  13. };





以上是关于462. Minimum Moves to Equal Array Elements II 最小移动到等数组元素II的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode 462. Minimum Moves to Equal Array Elements II

[Math_Medium]462. Minimum Moves to Equal Array Elements II

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

462 Minimum Moves to Equal Array Elements II 最少移动次数使数组元素相等 II

Leetcode-462 Minimum Moves to Equal Array Elements II(最少移动次数使数组元素相等 II)

LeetCode Minimum Moves to Equal Array Elements