[LeetCode&Python] Problem 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(object):
    def minMoves(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        total=0
        m=min(nums)
        for i in nums:
            total+=i-m
        return total

[LeetCode&Python] Problem 453. Minimum Moves to Equal Array Elements

原文：https://www.cnblogs.com/chiyeung/p/10048491.html