Grumpy Bookstore Owner Python Solution

lcpy gen -n 1052   # by problem number
lcpy gen -s grumpy_bookstore_owner   # by problem name

Input: customers = [1,0,1,2,1,1,7,5], grumpy = [0,1,0,1,0,1,0,1], minutes = 3
Output: 16
Explanation: The bookstore owner keeps themselves not grumpy for the last 3 minutes. The maximum number of customers that can be satisfied = 1 + 1 + 1 + 1 + 7 + 5 = 16.

Input: customers = [1], grumpy = [0], minutes = 1
Output: 1

class Solution:
    # Time: O(n) sliding window
    # Space: O(1)
    def max_satisfied(self, customers: list[int], grumpy: list[int], minutes: int) -> int:
        base = sum(c for c, g in zip(customers, grumpy, strict=True) if g == 0)
        gain = sum(customers[i] * grumpy[i] for i in range(minutes))
        best = gain
        for i in range(minutes, len(customers)):
            gain += customers[i] * grumpy[i] - customers[i - minutes] * grumpy[i - minutes]
            best = max(best, gain)
        return base + best