LC-0628 Easy LeetCode

628. Maximum Product of Three Numbers

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 45% Topics: Array, Math, Sorting

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def maximumProduct(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        min1, min2 = float("inf"), float("inf")
        max1, max2, max3 = float("-inf"), float("-inf"), float("-inf")

        for n in nums:
            if n <= min1:
                min2 = min1
                min1 = n
            elif n <= min2:
                min2 = n

            if n >= max1:
                max3 = max2
                max2 = max1
                max1 = n
            elif n >= max2:
                max3 = max2
                max2 = n
            elif n >= max3:
                max3 = n

        return max(min1 * min2 * max1, max1 * max2 * max3)

Solution from kamyu104/LeetCode-Solutions · MIT