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]

Solution in python:

class Solution:
    def minMoves(self, nums: List[int]) -> int:
        i = 0
        j = len(nums)-1
        moves = 0
        nums.sort()
        while j > 0:
            moves += nums[j] - nums[0]
            j -= 1
        return moves