DataWhale:leetcode Day18

一、leetcode地址

https://leetcode.com/problems/product-of-array-except-self/

二、问题描述

三、代码实现

语言：Python3
代码：

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n = len(nums)
        product = 1;i = 0;list1 = []
        while i < n:
            list1.append(product)
            product *=nums[i]
            i += 1
        product = 1;list2 = [];j = n-1
        while j > -1:
            list2.append(product)
            product *=nums[j]
            j -= 1
        output = []
        for k in range(n):
            output.append(list1[k]*list2[n-k-1])
        return output

四、运行结果