leetcode/algorithms/MaximumProductOfThreeNumbers/solution.js at master · P-ppc/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
 * @param {number[]} nums
 * @return {number}
 */
var maximumProduct = function(nums) {
    let max1 = Number.MIN_SAFE_INTEGER,
        max2 = Number.MIN_SAFE_INTEGER,
        max3 = Number.MIN_SAFE_INTEGER,
        min1 = Number.MAX_SAFE_INTEGER,
        min2 = Number.MAX_SAFE_INTEGER

    nums.forEach(num => {
        if (num >= max1) {
            max3 = max2
            max2 = max1
            max1 = num
        } else if (num >= max2) {
            max3 = max2
            max2 = num
        } else if (num >= max3) {
            max3 = num
        }

        if (num <= min1) {
            min2 = min1
            min1 = num
        } else if (num <= min2) {
            min2 = num
        }
    })

    return Math.max(max1 * max2 * max3, max1 * min1 * min2)
};