[Leet Code] 561. Array Partition

class Solution:
    # def selection_sort(self, nums):
    #     for i in range(len(nums)):
    #         smallest = i
    #         for j in range(i+1, len(nums)):
    #             if nums[j] < nums[smallest]:
    #                 smallest = j
    #         nums[i], nums[smallest] = nums[smallest], nums[i]
    #     return nums
    def arrayPairSum(self, nums: List[int]) -> int:
        # nums = self.selection_sort(nums)
        nums.sort()
        result = 0
        for i in range(0,len(nums), 2):
            result += nums[i]
        return result