파비의 매일매일 공부기록

2023.12.18 Today's Challenge 본문

Problem Solving/LeetCode

2023.12.18 Today's Challenge

fabichoi 2023. 12. 18. 23:45

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

 

Maximum Product Difference Between Two Pairs - LeetCode

Can you solve this real interview question? Maximum Product Difference Between Two Pairs - The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d). * For example, the product difference between (5, 6) and (2, 7) is (5 * 6

leetcode.com

정렬 후 푸는 문제. 매우 쉬움

class Solution:
    def maxProductDifference(self, nums: List[int]) -> int:
        nums.sort(reverse=True)
        return nums[0] * nums[1] - nums[-1] * nums[-2]
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.12.20 Today's Challenge  (1) 2023.12.20
2023.12.19 Today's Challenge  (0) 2023.12.19
2023.12.17 Today's Challenge  (0) 2023.12.17
2023.12.16 Today's Challenge  (1) 2023.12.16
2023.12.15 Today's Challenge  (0) 2023.12.15
'Problem Solving/LeetCode' Related Articles more
Comments