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

Example 1:

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

答案：

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

知识点：

1.排序

八大排序算法的 Python 实现

2.列表

Python 列表(List)