Leetcode算法学习日志-561 Array Partition I

Leetcode 561 Array Partition I

题目原文

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:

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

题意分析

将2n个数分为n对，求每一对的最小值，然后将所有最小值加起来，使得和最大，求这个最大和。

解法分析

本题采用贪心思想，要使得最终和最大，就要让较大的数成为数对中的小量，因此可以对数列从小到大排序，按序配对，小的和小的配对，大的和大的配对。C++代码如下：

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int sum=0;
        int i=0;
        int n=nums.size();
        if(n==1||n==0)
            return 0;
        while(i<n){
            sum+=nums[i];
            i+=2;    
        }
        return sum;    
    }
};