152. 乘积最大子数组

最新推荐文章于 2025-11-24 15:28:47 发布

原创最新推荐文章于 2025-11-24 15:28:47 发布 · 167 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #go

Leetcode 专栏收录该内容

126 篇文章

订阅专栏

原题

https://leetcode.cn/problems/maximum-product-subarray/description/

思路

动态规划

复杂度

时间：O(n)
空间：O(n)

Python代码

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        dp_max = nums[:]
        dp_min = nums[:]
        for i in range(1, len(nums)):
            dp_max[i] = max(dp_min[i-1] * nums[i], dp_max[i-1] * nums[i], nums[i])
            dp_min[i] = min(dp_min[i-1] * nums[i], dp_max[i-1] * nums[i], nums[i])
        return max(dp_max)

Go代码

func maxProduct(nums []int) int {
	dp_max, dp_min := make([]int, len(nums)), make([]int, len(nums))
	copy(dp_max, nums)
	copy(dp_min, nums)
	for i := 1; i < len(nums); i++ {
		dp_max[i] = max(dp_min[i-1]*nums[i], dp_max[i-1]*nums[i], nums[i])
		dp_min[i] = min(dp_min[i-1]*nums[i], dp_max[i-1]*nums[i], nums[i])
	}
	return slices.Max(dp_max)
}