除自身以外数组的乘积

类似于脑筋急转弯的问题，练的是算法思维
左侧的乘积*右侧的乘积就是除自身以外数组的乘积

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n = len(nums)
        #左侧数组
        left = [1]*n
        for i in range(1, n):
            left[i] = left[i-1] * nums[i-1]
        #右侧数组
        right = [1]*n
        for i in range(n-2, -1, -1) :
            right[i] = right[i+1] * nums[i+1]
        #把左侧数组作为结果数组
        for i in range(0, n):
            left[i] *= right[i]
        return left
优化方法，空间复杂度O(1)，将方法一后两个循环合二为一
class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n = len(nums)
        #左侧数组
        left = [1]*n
        for i in range(1, n):
            left[i] = left[i-1] * nums[i-1]
        #右侧right，两步合并为一步，从右向左遍历
        right = 1
        for i in range(n-1, -1, -1) :
            left[i] *= right#相当于从最右边乘
            right *= nums[i]
        return left