问题:
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个值加1就是一个值减1,14ms
public class Solution {
public int minMoves(int[] nums) {
if (nums.length == 0) return 0;
int min = nums[0];
for (int n : nums) min = Math.min(min, n);
int res = 0;
for (int n : nums) res += n - min;
return res;
}
}
② 公式 sum(array)- n * min(array)。11ms
我们假设sum为移动前所有数组值之和,minNum是数组中的最小值,n是数组的长度,经过m次移动n-1个小于最大值的数,我们得到所有数组值相等为x.可以得到如下公式:
sum + m * (n - 1) = x * n
另外还有:x = minNum + m
最后,我们可以得到:sum - minNum * n = m
public class Solution {
public int minMoves(int[] nums) {
int min = Integer.MAX_VALUE;
int sum = 0;
for(int i = 0 ; i < nums.length ; i ++){
min = Math.min(min, nums[i]);
sum += nums[i];
}
return sum - nums.length * min;
}
}