[leetcode] 238. Product of Array Except Self

原题

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

python代码

class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        output=[1]*len(nums)
        n=len(nums)

        prod=1
        for i in range(1,n):
            prod=prod*nums[i-1]
            output[i]*=prod

        prod=1
        for i in range(n-2,-1,-1):
            prod=prod*nums[i+1]
            output[i]*=prod

        return output