1. 题目

2.分析

可以得到递推公式如下：

3.代码

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        dmax = [0]* len(nums)
        dmin = copy.deepcopy(dmax)
        # print(dmin)
        
        dmax[0] = dmin[0] = nums[0]
        for i in range(1,len(nums)):
            cur = nums[i]
            dmax[i] = max(dmax[i-1] * cur,dmin[i-1] * cur ,cur)
            # print(dmax)
            dmin[i] = min(dmin[i-1] * cur,dmax[i-1]* cur, cur)
        
        return max(dmax)