leetcode/problems/maximum-product-of-three-numbers at main · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
maximum_product_of_three_numbers.go		maximum_product_of_three_numbers.go
maximum_product_of_three_numbers_test.go		maximum_product_of_three_numbers_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

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: