Product of Array Except Self
This is the solution about Leetcode - 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].
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.)
Let’s take an example:
Given array[1, 2, 3, 4, 5], regarding the third number 3, the product of array except 3 is 1 2 and right is 4 5. The product is left * right.
So time complexity is O(n+n), the extra space is O(1).
Similar with Solution1, instead of variable temp, we use result to store right product.