Leetcode 238 Product of Array Except Self

Leetcode 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.)

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/product-of-array-except-self
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

思路解析

• 暴力法

class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        length = len(nums)
        result = []
        for i in range(length):
            temp = copy.copy(nums)
            temp.pop(i)
            result.append(self.mutiply(temp))
        return result
    
    def mutiply(self, temp):
        result = 1
        for i in range(len(temp)):
            result *= temp[i]
        return result

时间复杂度$O(N^2)$，空间复杂度$O(N)$

• 在暴力法的思路中，使用了嵌套for循环，导致时间复杂度为$O(N^2)$。

  我们可以将数组中除当前数以外的所有数的乘积分解为当前数左边的数的乘积、当前数右边的数的乘积两部分，这两部分相乘即是我们期望的结果。

  从而将嵌套for循环改为两个并列for循环，使时间复杂度降为$O(N)$。

  代码如下：

class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        length = len(nums)
        result = [0 for i in range(length)]
        k = 1
        for i in range(length):
            result[i] = k
            k *= nums[i]

        k = 1
        for i in range(length - 1, -1, -1):
            result[i] *= k
            k *= nums[i]
        
        return result

时间复杂度为$O(N)$，空间复杂度为$O(N)$