class Solution:
def findMinMoves(self, machines: List[int]) -> int:
sum_ = sum(machines)
l = len(machines)
if sum_ % l != 0:
return -1
target = int(sum_ / l)
res = 0
balance = 0
for i in range(l):
balance += machines[i] - target
res = max(res, machines[i] - target, abs(balance))
return res
超级洗衣机
最新推荐文章于 2023-02-15 10:00:12 发布