【LeetCode-462】Minimum Moves to Equal Array Elements 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]

解题思路：首先对数组进行排序，寻找中位数，每个数与中位数的差之和就是结果。

public class MinimumMovesToEqualArrayElementsII462 {
    public int minMoves2(int[] nums) {
        if(nums == null || nums.length == 0) return 0;
        Arrays.sort(nums);
        int len = nums.length;
        int target = nums[len >> 1];

        int res = 0;
        for(int i : nums) res += Math.abs(i - target);

        return res;
    }
}