238. Product of Array Except Self

题目链接：https://leetcode.com/problems/product-of-array-except-self/

代码

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n=len(nums)
        dp1,dp2=[1]*n,[1]*n
        for i in range(1,n): 
            dp1[i]=dp1[i-1]*nums[i-1]
            dp2[n-i-1]=dp2[n-i]*nums[n-i]
        res=[0]*n
        for i in range(n):
            res[i]=dp1[i]*dp2[i]
        return res

解题思路

双向动态规划