给定一个大小为n
的非空整数数组,找出使得数组中所有元素相同的最少步数,其中一步被定义为将数组中n - 1
个元素加一。
样例
输入:
[1,2,3]
输出:
3
说明:
只需要三步即可(每一步将其中两个元素加一):
[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
class Solution:
"""
@param nums: an array
@return: the minimum number of moves required to make all array elements equal
"""
def minMoves(self, nums):
# Write your code here
sum = 0
minmum = min(nums)
for i in nums:
sum += i-minmum
return sum