453. Minimum Moves to Equal Array Elements (Easy)

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]

题意：通过最小的移动次数，使所有元素都相等；

思路：

1.对除了最大值之外的所有元素进行加1操作，相当于对最大元素的减1操作；

2.将所有元素都减少到最小值，然后累加计算所有元素与最小值之间的差值；

class Solution():
    def minMoves(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        return sum(nums) - min(nums) * len(nums)