561.Array Partition I--Python

刚开始学习Python编程，欢迎交流学习!

561.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.

Input: [1,4,3,2]

Output: 4

Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).

Note:

n is a positive integer, which is in the range of [1, 10000].

All the integers in the array will be in the range of [-10000, 10000].

思路：由题目示例可以看出输出只要为最终的和可以了，所以不一定非得先将一个大的数组（列表）中的数据先挨个化成分开的小数组（列表），正确理解题目意思，可以输出结果就行了。所以直接对原数组（列表）排序（Python自带的函数），然后取偶数项相加就可以了。

    class Solution:
        def arrayPairSum(self, nums):
         """
            :type nums: List[int]
            :rtype: int
         """
        nums.sort()
        return sum(nums[::2])