【leetcode】1052. 爱生气的书店老板

题目

解法

class Solution:
    def maxSatisfied(self, customers, grumpy, X) -> int:
        '''
        固定窗口最大和
        :param customers:
        :param grumpy:
        :param X:
        :return:
        '''
        minus=len(customers)
        cus_gru=[]
        normal=0
        for cus,gru in zip(customers,grumpy):
            cus_gru.append(cus*gru)
            if gru==0:
                normal+=cus
        maxSat=0
        for i in range(minus-X+1):
            maxSat=max(maxSat,sum(cus_gru[i:i+X]))
        return normal+maxSat