[LeetCode&Python] Problem 561. Array Partition I

2021-06-19 20:05

阅读：471

标签：code from put integer pairs tco ... eth and

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:

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

My method:

Step 1: sort the list L

Step 2: sum(L[0]+L[2]+L[4]+...+L[2n-2])

Code:

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

[LeetCode&Python] Problem 561. Array Partition I

标签：code from put integer pairs tco ... eth and

原文地址：https://www.cnblogs.com/chiyeung/p/9690349.html

上一篇：C/C++ - malloc/free和new/delete的区分

下一篇：springboot2.0集成shiro出现ShiroDialect报错找不到AbstractTextChildModifierAttrPr

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：[LeetCode&Python] Problem 561. Array Partition I
文章链接：http://soscw.com/essay/96098.html

亲，登录后才可以留言！

[LeetCode&Python] Problem 561. Array Partition I

评论

热门文章

推荐文章

最新文章

置顶文章

[LeetCode&amp;Python] Problem 561. Array Partition I

评论

热门文章

推荐文章

最新文章

置顶文章

[LeetCode&Python] Problem 561. Array Partition I