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 int minMoves2(int[] nums) {
        Arrays.sort(nums);
        int index = nums.length / 2;
        int sum = 0;
        for(int i = 0; i < nums.length; i++) {
            sum += Math.abs(nums[i] - nums[index]);
        }
        return sum;
    }