题目：

题解：

class Solution:def findMinMoves(self, machines: List[int]) -> int:tot = sum(machines)n = len(machines)if tot % n:return -1avg = tot // nans, s = 0, 0for num in machines:num -= avgs += numans = max(ans, abs(s), num)return ans