python-algorithm
Leetcode 1913. Maximum Product Difference Between Two Pairs
무적김두칠
2021. 7. 16. 13:45
|
1
2
3
4
|
class Solution:
def maxProductDifference(self, nums: List[int]) -> int:
nums=sorted(nums)
return nums[-1]*nums[-2]-nums[0]*nums[1]
|
cs |
반응형