1052. Grumpy Bookstore Owner [Medium] 滑动窗口

最新推荐文章于 2022-11-21 02:54:08 发布

木木歹朱

最新推荐文章于 2022-11-21 02:54:08 发布

阅读量165

点赞数

本文链接：https://blog.csdn.net/qq_35319215/article/details/98261882

版权

1052. Grumpy Bookstore Owner

class Solution(object):
    def maxSatisfied(self, customers, grumpy, X):
        """
        :type customers: List[int]
        :type grumpy: List[int]
        :type X: int
        :rtype: int
        """
        m = len(customers)
        res = max_res = 0
        for i in range(m):
            if grumpy[i] == 0:
                res += customers[i]
        max_res = max(res, max_res)
        for i in range(X):
            if grumpy[i] == 1:
                res += customers[i]
        max_res = max(res, max_res)
        for j in range(X, m):
            i = j - X
            if grumpy[i] == 1:
                res -= customers[i]
            if grumpy[j] == 1:
                res += customers[j]
            max_res = max(res, max_res)
        return max_res