Array Partition LeetCode solution in Python

1
class Solution(object):
2
    def arrayPairSum(self, nums):
3
        """
4
        :type nums: List[int]
5
        :rtype: int
6
        """
7

8
        nums = sorted(nums)
9

10
        summ = 0
11
        for i in range(0, len(nums), 2):
12
            summ += min(nums[i], nums[i + 1])
13
        return summ