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

Note:

1. n is a positive integer, which is in the range of [1, 10000].
2. All the integers in the array will be in the range of [-10000, 10000].

# -*- coding:utf-8 -*-
__author__ = 'yangxin_ryan'
"""
Solutions：我们先理解题目的意思，其实是输入2n个数字，然后分成n对（分区），
分区的方式要求累加其中每对的min()值，
因此我们想到就是尽可能吧每个值都按照升序的方式排序，然后然后计算出来的和就好了。
"""


class ArrayPartitionI(object):

    def arrayPairSum(self, nums: List[int]) -> int:
        """
        :pa