Leetcode 1599. Maximum Profit of Operating a Centennial Wheel (python)

最新推荐文章于 2022-05-08 08:22:43 发布

努利！奋斗！

最新推荐文章于 2022-05-08 08:22:43 发布

阅读量171

点赞数

分类专栏： Leetcode 其他类型题目文章标签： leetcode python

本文链接：https://blog.csdn.net/qq_37821701/article/details/108961897

版权

Leetcode 其他类型题目专栏收录该内容

106 篇文章 1 订阅

订阅专栏

该博客详细介绍了如何解决LeetCode上的1599题，即操作世纪摩天轮以获得最大利润的问题。解题思路主要采用贪心算法，通过迭代顾客数量，计算每次上客和运行成本，更新最大利润和旋转次数。代码经过优化，提高了可读性。

摘要由CSDN通过智能技术生成

Leetcode 1599. Maximum Profit of Operating a Centennial Wheel

题目
解法：

题目

题目太长，直接放链接吧 https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel/

解法：

仔细地读懂题目不难做，就是greedy的思想

一开始写了一个非常丑的版本：

class Solution:
    def minOperationsMaxProfit(self, customers: List[int], boardingCost: int, runningCost: int) -> int:
        profit = 0
        waiting = 0
        rotation = 0
        max_profit = 0
        ans = None
        for customer in customers:
            customer += waiting
            rotation += 1
            if customer>=4:
                profit += 4*boardingCost - runningCost
                waiting = customer-4
            else:
                profit = customer*boardingCost - runningCost
                waiting = 0
            
            if max_profit<profit:
                max_pprofit = profit
                ans = rotation
        
        if waiting>0:
            if waiting>4:
                while waiting>4:
                    profit += 4*boardingCost - runningCost
                    waiting = waiting-4
                    rotation += 1
                    #print(profit)
                    if max_profit<profit:
                        max_pprofit = profit
                        ans = rotation
            
        profit = waiting*boardingCost - runningCost
        rotation+=1
        if max_profit<profit:
            max_pprofit = profit
            ans = rotation
        
        return ans if ans else -1

美化了一下代码：

profit = 0
        waiting = 0
        rotation = 0
        max_profit = 0
        ans = None
        for customer in customers:
            customer += waiting
            rotation += 1
            onboarding = min(4,customer)
            profit += onboarding*boardingCost - runningCost
            waiting = customer - onboarding
            
            if max_profit<profit:
                max_pprofit = profit
                ans = rotation
        
        if 4*boardingCost - runningCost>0:
            steps = waiting//4
            profit += steps*(4*boardingCost - runningCost)
            waiting = waiting - steps*4
            if waiting*boardingCost - runningCost>0:
                profit += waiting*boardingCost - runningCost
                steps += 1
            if max_profit<profit:
                max_pprofit = profit
                ans = rotation + steps
        
        
        return ans if ans else -1