Given an integer array nums, return an array answer where answer[i] is the product of every element of nums except nums[i].
Solve it in O(n) time without using division.
Examples
Example 1
- Input
- nums = [1, 2, 3, 4]
- Output
- [24, 12, 8, 6]
Example 2
- Input
- nums = [-1, 1, 0, -3, 3]
- Output
- [0, 0, 9, 0, 0]
Constraints
2 <= nums.length <= 10^5-30 <= nums[i] <= 30- Every product fits in a 32-bit integer.