561. Array Partition I

最新推荐文章于 2024-04-22 17:01:34 发布

原创最新推荐文章于 2024-04-22 17:01:34 发布 · 153 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode(Go) 专栏收录该内容

19 篇文章

订阅专栏

本文解析了一道算法题目，任务是将给定的2n个整数两两配对，使得每对中较小数之和尽可能大。通过排序并选取每对中的第一个元素求和来实现这一目标。示例输入为[1,4,3,2]，输出为4，即min(1,2)+min(3,4)。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a₁, b₁), (a₂, b₂), ..., (a_n, b_n) which makes sum of min(a_i, b_i) 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].

func arrayPairSum(nums []int) int {
    ret:=0
    sort.Ints(nums)
    for i:=0 ; i<len(nums); i+=2 {
        ret = ret+nums[i]
    }
    return ret
}

非最优解