LeetCode 풀기 - 1464. Maximum Product of Two Elements in an Array

1464. Maximum Product of Two Elements in an Array

https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/

Maximum Product of Two Elements in an Array - LeetCode

 

문제)

솔루션1)

• O(nlogn)

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

솔루션2)

• O(n)

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        a, b = 0, 0
        
        for n in nums:
            if b < n:
                a, b = b, n
            elif a < n:
                a = n
        return (a-1) * (b-1)