【leetcode】453. Minimum Moves to Equal Array Elements【E】

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]

Subscribe to see which companies asked this question

这个问题，看tag是个math

然后简单分析，其实就是可以这样做

把数组排序，然后每个元素减去最小的元素，再把剩下的结果加起来，就是答案了

我是终于理解人们为什么要一行代码解决问题了，因为有成就感啊！！哈哈哈

class Solution(object):
def minMoves(self, nums):
return sum(nums) - min(nums)*(len(nums))