product-of-array-except-self

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code>, return an array <code>answer</code> such that <code>answer[i]</code> is equal to the product of all the elements of <code>nums</code> except <code>nums[i]</code>.

The product of any prefix or suffix of <code>nums</code> is guaranteed to fit in a 32-bit integer.

You must write an algorithm that runs in&nbsp;<code>O(n)</code>&nbsp;time and without using the division operation.

&nbsp;
Example 1:
<pre>Input: nums = [1,2,3,4]
Output: [24,12,8,6]
</pre>Example 2:
<pre>Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-30 &lt;= nums[i] &lt;= 30</code></li>
	<li>The input is generated such that <code>answer[i]</code> is guaranteed to fit in a 32-bit integer.</li>
</ul>

&nbsp;
Follow up:&nbsp;Can you solve the problem in <code>O(1)</code>&nbsp;extra&nbsp;space complexity? (The output array does not count as extra space for space complexity analysis.)