Maximum Product of Two Elements in an Array LeetCode solution in Python

1
class Solution:
2
    def maxProduct(self, nums: List[int]) -> int:
3
        # mx1 - max element, mx2 - second max element
4
        mx1 = nums[0] if nums[0] > nums[1] else nums[1]
5
        mx2 = nums[1] if nums[0] > nums[1] else nums[0]
6
        for num in nums[2:]:
7
            if num > mx1:
8
                mx1, mx2 = num, mx1
9
            elif num > mx2:
10
                mx2 = num
11

12
        return (mx1 - 1) * (mx2 - 1)