> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0628-maximum-product-of-three-numbers.md).

# 0628. Maximum Product of Three Numbers

<https://leetcode.com/problems/maximum-product-of-three-numbers>

## Description

Given an integer array `nums`, *find three numbers whose product is maximum and return the maximum product*.

**Example 1:**

```
**Input:** nums = [1,2,3]
**Output:** 6
```

**Example 2:**

```
**Input:** nums = [1,2,3,4]
**Output:** 24
```

**Example 3:**

```
**Input:** nums = [-1,-2,-3]
**Output:** -6
```

**Constraints:**

* `3 <= nums.length <= 104`
* `-1000 <= nums[i] <= 1000`

## ac

```java
```