152.乘积最大子数组leetcode

ranzhiyimu

于 2025-04-03 20:47:31 发布

阅读量74

点赞数 3

CC 4.0 BY-SA版权

文章标签：算法 leetcode 职场和发展

本文链接：https://blog.youkuaiyun.com/ranzhiyimu/article/details/146988600

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        cur_max=nums[0]
        cur_min=nums[0]
        global_max=nums[0]
        for i in range (1,len(nums)):
            temp_max =cur_max
            temp_min =cur_min
            cur_max =max(temp_max*nums[i],temp_min*nums[i],nums[i])
            cur_min =min(temp_max*nums[i],temp_min*nums[i],nums[i])
            global_max= max(cur_max,global_max)
        return global_max