LeetCode Array Partition I

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.

Example 1:
Input: [1,4,3,2]

Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4.

#coding=utf-8class Solution(object):    def arrayPairSum(self, nums):        """        :type nums: list[int]        :rtype: int        """        nums.sort()        l = len(nums)        r = 0        for i in range(0,l,2):            r+=nums[i]        return r