maximum-product-of-three-numbers

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

Find three numbers whose product is maximum and return the maximum product.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3]

Output: 6

Explanation:

The only three numbers are 1, 2, and 3, so the maximum product is <code>1 * 2 * 3 = 6</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,2,3,4]

Output: 24

Explanation:

The largest product comes from the three greatest numbers: <code>2 * 3 * 4 = 24</code>.
</div>

Example 3:

<div class="example-block">
Input: nums = [-1,-2,-3]

Output: -6

Explanation:

The only three numbers are -1, -2, and -3, so the maximum product is <code>(-1) * (-2) * (-3) = -6</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>3 &lt;= nums.length &lt;=&nbsp;104</code></li>
	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
</ul>