238. Product of Array Except Self

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

Example:

Input:
[1,2,3,4]
Output:
[24,12,8,6]

Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

Solution

(1) Java



(2) Python

class Solution:
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        if not nums:
            return []
        rst = [1]*len(nums)
        for i in range(1, len(nums)):
            rst[i] = rst[i-1]*nums[i-1]
        right = 1
        for i in range(len(nums)-1, -1, -1):
            rst[i] = rst[i]*right
            right *= nums[i]
        return rst

(3) Scala



results matching ""

    No results matching ""