Leetcode1052.Grumpy Bookstore Owner

There is a bookstore owner that has a store open for n minutes. Every minute, some number of customers enter the store. You are given an integer array customers of length n where customers[i] is the number of the customer that enters the store at the start of the ith minute and all those customers leave after the end of that minute.

On some minutes, the bookstore owner is grumpy. You are given a binary array grumpy where grumpy[i] is 1 if the bookstore owner is grumpy during the ith minute, and is 0 otherwise.

When the bookstore owner is grumpy, the customers of that minute are not satisfied, otherwise, they are satisfied.

The bookstore owner knows a secret technique to keep themselves not grumpy for minutes consecutive minutes, but can only use it once.

Return the maximum number of customers that can be satisfied throughout the day.

class Solution:
    def maxSatisfied(self, customers: List[int], grumpy: List[int], minutes: int) -> int:
        #for some not grumpy time, we should seperate them and simply sum them up
        #for grumpy time, we use sliding window to check the max_sum
        size = len(customers)
        ls1 = []
        ls2 = []
        for i in range(size):
            if grumpy[i] == 0:
                ls1.append(customers[i])
                ls2.append(0)
            else:
                ls1.append(0)
                ls2.append(customers[i])
        
        left = right = 0
        cur_sum = 0
        max_sum = 0
        while right < size:
            cur_sum += ls2[right]
            if right - left + 1 > minutes:
                cur_sum -= ls2[left]
                left+=1
            max_sum = max(max_sum, cur_sum)
            right+=1
        return max_sum + sum(ls1)