[리트코드 leetcode] 561. Array Partition I

leetcode.com/problems/array-partition-i/

Array Partition I - LeetCode

 

class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
        nums.sort()
        sum =0
        
        for i in range(0,len(nums),2):
            sum +=nums[i]
            
        return sum