1877. Minimize Maximum Pair Sum in Array

[흑화뉴비(coderhs)]

개날먹이라 올려봄

class Solution:

    def minPairSum(self, nums: List[int]) -> int:

        return nums.sort() or max([nums[i]+nums[-i-1] for i in range(len(nums)//2)])