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 incrementingn - 1 elements by 1.

Example:

Input:[1,2,3]Output:3Explanation: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        """        nums.sort()        c = 0        for i in range(len(nums)-1, -1, -1):            if nums[i] == nums[0]:                break            c += nums[i] - nums[0]                    return c
class Solution(object):    def minMoves(self, nums):        """        :type nums: List[int]        :rtype: int        """        return sum(nums) - len(nums)*min(nums)