GoLang Solution For LeetCode Problem: Maximum Product of Three Numbers
Solving Maximum Product of Three Numbers in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given an integer array, find three numbers whose product is maximum and output the maximum product.
Input: [1,2,3] Output: 6
Input: [1,2,3,4] Output: 24
- The length of the given array will be in range [3,10^4] and all elements are in the range [-1000, 1000].
- Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
See the full details of the problem Maximum Product of Three Numbers at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go