题目很好理解,在做的时候我们可以尝试先计算所有的总和,计算过的算为0,之后我们来计算连续X个的哪个总和最大,求和就可以
n = len(customers)
res = 0
for i in range(n):
if grumpy[i] == 0:
res += customers[i]
customers[i] = 0
right = X
left = 0
maxI = 0
while right <= n:
maxI = max(maxI, sum(customers[left:right]))
right += 1
left += 1
return res + maxI