Given an integer array nums, return an array answer such that answer[i] is the product of all elements of nums except nums[i]. Solve it without using the division operator, in O(n) time.
Input: one line of space-separated integers. Output: the answer array, space-separated.
1 2 3 4
24 12 8 6
-1 1 0 -3 3
0 0 9 0 0
Run your code against the sample tests, or Submit to run the full suite.