Given an array of integers, which can contain both +ve and -ve numbers. I've to maximize the product of any 3 elements of the array. The elements can be non-contiguous. Given an array of integers, which can contain b
阅读背景：
在一个数组中找到3个数字的最大乘积。
来源：互联网
分享到：
