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].

Follow up:

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



  • [1, a1, a1*a2, a1*a2*a3]
  • [a2*a3*a4, a3*a4, a4, 1]

然后两个数组一一对应相乘,即可得到最终结果 [a2*a3*a4, a1*a3*a4, a1*a2*a4, a1*a2*a3]


代码1 O(n)空间

代码2 O(1)空间

results matching ""

    No results matching ""