human
I found an interesting problem on https://leetcode.com/problems/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]

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is Python code to find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

class Solution:
     def minMoves(self, nums):
         """
         :type nums: List[int]
         :rtype: int
 
         let’s define sum as the sum of all the numbers, before any moves; 
             minNum as the min number int the list; 
             n is the length of the list;
 
         After, say m moves, we get all the numbers as x , and we will get the following equation
 
         sum + m * (n - 1) = x * n
         and actually,
 
           x = minNum + m
         and finally, we will get
 
           sum - minNum * n = m
         So, it is clear and easy now.        
         """
         tt = 0
         mx = nums[0]
         n = 0
         for x in nums:
             tt += x
             n += 1
             if x < mx:
                 mx = x
         return tt - mx * n