Minimum Moves to Equal Array Elements LeetCode solution in Python

1
class Solution:
2
    def minMoves(self, nums: List[int]) -> int:
3
        return sum(nums) - min(nums) * len(nums)