leetcode-238：除自身以外数组的乘积

输入: [1,2,3,4]
输出: [24,12,8,6]

class Solution:
    def productExceptSelf(self, nums: [int]) -> [int]:
        res, p, q = [1], 1, 1
        for i in range(len(nums) - 1): # bottom triangle
            p *= nums[i]
            res.append(p)
        for i in range(len(nums) - 1, 0, -1): # top triangle
            q *= nums[i]
            res[i - 1] *= q
        return res

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        n = len(nums)
        res = []
        for i in range(n):
            tmp=1
            for j in range(n):
                if j!=i:
                    tmp*=nums[j]
            res.append(tmp)
        return res