maximum-product-of-three-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, find three numbers whose product is maximum and return the maximum product.

&nbsp;
Example 1:
<pre>Input: nums = [1,2,3]
Output: 6
</pre>Example 2:
<pre>Input: nums = [1,2,3,4]
Output: 24
</pre>Example 3:
<pre>Input: nums = [-1,-2,-3]
Output: -6
</pre>
&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>

maximumProduct

Maximum Product of Three Numbers

Maximum Product Subarray

maximum-product-subarray

乘积最大子数组

Array

Math

Sorting

给你一个整型数组 <code>nums</code> ，在数组中找出由三个数组成的最大乘积，并输出这个乘积。

 

示例 1：

<pre>
输入：nums = [1,2,3]
输出：6
</pre>

示例 2：

<pre>
输入：nums = [1,2,3,4]
输出：24
</pre>

示例 3：

<pre>
输入：nums = [-1,-2,-3]
输出：-6
</pre>

 

提示：

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