【leetcode】561. Array Partition I

30.94%  开始觉得题目好复杂，后来想到了之后发现很简单，就是效率不高，运行时间久

class Solution(object):
    def arrayPairSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums = sorted(nums)
        sums = 0
        for i in range(len(nums)/2):
            sums += min(nums[2*i],nums[2*i+1])
        return sums

----------------------------------------------

傻了，发现可以简化一步

70.98%

class Solution(object):
    def arrayPairSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums = sorted(nums)
        sums = 0
        for i in range(len(nums)/2):
            sums += nums[2*i]
        return sums

--------------------------------------------------------

耍花枪，一行搞定  5.26%   sum函数不如自己循环加上

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

--------------------------------------------------------