https://leetcode-cn.com/problems/array-partition-i/
观察可知,先排序,然后n组中每组取较小的累加即可,即i从0开始遍历,每次走两步
class Solution: def arrayPairSum(self, nums: List[int]) -> int: nums.sort() res = 0 for i in range(0, len(nums), 2): res += nums[i] return res
最后更新于5年前