Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.
Example:
Input:
[1,2,3]
Output:
3
Explanation:
Only three moves are needed (remember each move increments two elements):
[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
注意:是n-1个数字同时加一,我理解成两个了 所以一直没做出来。
public static int minMoves(int[] nums) {
if (nums.length == 0) return 0;
Arrays.sort(nums);
int min = nums[0];
int res = 0;
for (int n : nums)
res += n - min;
return res;
}