Minimum Moves to Equal Array Elements
Minimum Moves to Equal Array Elements

Minimum Moves to Equal Array Elements
• 发表于 4个月前
• 阅读 4
• 收藏 0
• 评论 0

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 + m * (n - 1) = x * n

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;
}
}

×