mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
21 lines
679 B
HTML
21 lines
679 B
HTML
|
<p>Given an integer array <code>nums</code>, <em>find three numbers whose product is maximum and return the maximum product</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [1,2,3]
|
||
|
|
<strong>Output:</strong> 6
|
||
|
|
</pre><p><strong>Example 2:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [1,2,3,4]
|
||
|
|
<strong>Output:</strong> 24
|
||
|
|
</pre><p><strong>Example 3:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [-1,-2,-3]
|
||
|
|
<strong>Output:</strong> -6
|
||
|
|
</pre>
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>3 <= nums.length <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>-1000 <= nums[i] <= 1000</code></li>
|
||
|
|
</ul>
|