LeetCode 풀기 - 1913. Maximum Product Difference Between Two Pairs

1913. Maximum Product Difference Between Two Pairs

https://leetcode.com/problems/maximum-product-difference-between-two-pairs/

Maximum Product Difference Between Two Pairs - LeetCode

문제)

솔루션1)

• 시간 복잡도 : O(nlogn)
• 공간 복잡도 : O(1)

class Solution:
    def maxProductDifference(self, nums: List[int]) -> int:
        nums.sort()
        return nums[-1] * nums[-2] - nums[0] * nums[1]

솔루션2)

• 시간 복잡도 : O(n)
• 공간 복잡도 : O(1)

class Solution:
    def maxProductDifference(self, nums: List[int]) -> int:
        min1, min2 = 10000, 10000
        max1, max2 = 1, 1
        
        for n in nums:
            if n < min1:
                min1, min2 = n, min1
            elif n < min2:
                min2 = n
                
            if n > max2:
                max1, max2 = max2, n
            elif n > max1:
                max1 = n
        return max1 * max2 - min1 * min2