# 453. Minimum Moves to Equal Array Elements

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]
``````

``````class Solution {
public:
int minMoves(vector<int>& nums) {
int mn = INT_MAX, res = 0;
for (int num : nums) mn = min(mn, num);
for (int num : nums) res += num - mn;
return res;
}
};
``````

``````class Solution {
public:
int minMoves(vector<int>& nums) {
long mn = INT_MAX, sum = 0, res = 0;
for (long num : nums) {
mn = min(mn, num);
sum += num;
}
return sum - mn * nums.size();
}
};
``````

Github 同步地址：

https://github.com/grandyang/leetcode/issues/453

https://leetcode.com/problems/minimum-moves-to-equal-array-elements/

https://leetcode.com/problems/minimum-moves-to-equal-array-elements/discuss/93822/Simple-one-liners

https://leetcode.com/problems/minimum-moves-to-equal-array-elements/discuss/93815/Java-O(n)-solution.-Short.

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation