628\. Maximum Product of Three Numbers

Easy

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:**

*   <code>3 <= nums.length <= 10<sup>4</sup></code>
*   `-1000 <= nums[i] <= 1000`