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