leetcode学习笔记(数组中最大数对和的最小值)

1877. 数组中最大数对和的最小值

原始解法

class Solution:
    def minPairSum(self, nums: List[int]) -> int:
        nums.sort()
        re = []
        i = 0
        j = len(nums) - 1
        while i < j:
            re.append(nums[i] + nums[j])
            i += 1
            j -= 1

        return max(re)       

同样原始

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