파비의 매일매일 공부기록

2023.11.18 Today's Challenge 본문

Problem Solving/LeetCode

2023.11.18 Today's Challenge

fabichoi 2023. 11. 18. 23:45

https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/

 

Minimize Maximum Pair Sum in Array - LeetCode

Can you solve this real interview question? Minimize Maximum Pair Sum in Array - The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs. * For example, if we have pairs (1,5), (2,3), and (4,4), the m

leetcode.com

정렬해서 푸는 매우 간단쓰한 문제

class Solution:
    def minPairSum(self, nums: List[int]) -> int:
        nums.sort()
        result = 0
        for i in range(len(nums)):
            result = max(nums[i] + nums[len(nums)-i-1],result)

        return result
반응형

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

2023.11.20 Today's Challenge  (1) 2023.11.20
2023.11.19 Today's Challenge  (0) 2023.11.19
2023.11.17 Today's Challenge  (0) 2023.11.17
2023.11.16 Today's Challenge  (0) 2023.11.16
2023.11.15 Today's Challenge  (0) 2023.11.15
'Problem Solving/LeetCode' Related Articles more
Comments