https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements/
image.png
这道题换个思维，n-1个少数民族加分相当于1个民族扣分
class Solution:
def minMoves(self, nums: List[int]) -> int:
minNum = min(nums)
ans = 0
for num in nums:
ans += (num - minNum)
return ans
``