Maximum Product Difference Between Two Pairs LeetCode solution in Python

1
class Solution:
2
    def maxProductDifference(self, nums: List[int]) -> int:
3
        max_1 = 0
4
        max_2 = 0
5
        min_1 = 10001
6
        min_2 = 10001
7
        for i in nums:
8
            if i >= max_1:
9
                max_2, max_1 = max_1, i
10
            elif i > max_2:
11
                max_2 = i
12
            if i <= min_1:
13
                min_2, min_1 = min_1, i
14
            elif i < min_2:
15
                min_2 = i
16

17
        return max_1 * max_2 - min_1 * min_2