https://leetcode-cn.com/problems/array-partition-i/description/
给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ，使得从1 到 n 的 min(ai, bi) 总和最大。
输入: [1,4,3,2]
输出: 4
解释: n 等于 2, 最大总和为 4 = min(1, 2) + min(3, 4).
排序后取偶数位即可
执行用时：128 ms
class Solution:
def arrayPairSum(self, nums):
nums.sort()
return sum(nums[::2])
链接 https://leetcode-cn.com/problems/array-partition-i/des...
题目 Given an array of 2n integers, your task is to group t...
Given an array of2nintegers, your task is to group these ...
Array Partition I 描述：Given an array of 2n integers, your ...
561. Array Partition I 566. Reshape the Matrix 485. Max C...
561. 数组拆分 I[https://leetcode-cn.com/problems/array-partit...
题目地址:https://leetcode.com/submissions/detail/160916288/大意...
地址：https://leetcode.com/problems/array-partition-i/ 题目： G...
Given an array of 2n integers, your task is to group thes...
https://leetcode.com/problems/array-partition-i/#/descrip...
本文标题：LeetCode 561. Array Partition I
本文链接：https://www.haomeiwen.com/subject/swbrwftx.html
网友评论