[leetcode-561] Array Partition

LeetCode-561

Array Partition : find maximum (minimum list)

note : len(list) = 2n

myAnswer

        :::python

class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
        nums.sort()
        return sum(nums[::2])

Result : 267ms Memory: 16.7mb