Leetcode-1052. Grumpy Bookstore Owner

Liuu Zn

于 2019-07-10 10:32:57 发布

阅读量178

点赞数 1

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.youkuaiyun.com/qq_24656853/article/details/95313105

版权

Leetcode 专栏收录该内容

10 篇文章

订阅专栏

博客围绕Leetcode上书店老板问题展开，先给出原题链接，解题思路是先统计老板不可能生气时的顾客数量，再用滚动求和计算能改变态度的最大顾客数，并给出了代码提示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Original link: https://leetcode.com/problems/grumpy-bookstore-owner/

First, count customers when the owner is impossible to be grumpy
Then use a rolling sum to calculate the maximum number of customers would change their attitude.

Code:

class Solution(object):
    def maxSatisfied(self, customers, grumpy, X):
        """
        :type customers: List[int]
        :type grumpy: List[int]
        :type X: int
        :rtype: int
        """
        
        op = 0
        
        for i in range(len(customers)):
            if grumpy[i] == 0:
                op += customers[i]
            else:
                grumpy[i] = customers[i]
                
        s = 0
        for i in range(X):
            s += grumpy[i]
        maxs = s
        for i in range(X, len(customers)):
            s += grumpy[i]
            s -= grumpy[i-X]
            maxs = max(maxs, s)
        
        op += maxs
        
        return op