LeetCode 561. Array Partition I

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.

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

analysis：
2n个数字分成n组，每组2个数字，取每组中较小的数字，求和。要求是得到的和最大，方法返回值即为这个最大和。

设2n个数字升序排序后为：a0，a1，a2，a3，….，a(2n-1)。
猜想一下容易发现，最大和即为 (a0+a2+a4+….+a(2n-2))，最小和即为(a0+a1+a2+…+a(n-1))。
得出这个结论后，我们马上就可以编码实现啦

my answer:

#include<iostream>;
#include<vector>//运用vector
#include <algorithm>//运用sort
using namespace std;

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());//排序
        int a = 0;
        for (int i = 0;i<nums.size();i = i + 2)//此处要小心不能写成i<=nums.size(),因为当i等于nums.size()时，继续循环，这样nums[i]就超出了数组的范围
        {
            a += nums[i];
        }
        return a;
    }

};

/*
C/C++ code
计算占用内存大小
sizeof(array)
计算数组元素个数
sizeof(array) / sizeof(array[0])
*/
int main()
{
    int num[] = { 1,4,2,3 };
    Solution a;
    int b = sizeof(num) / sizeof(num[0]);
    vector<int> nums(num,num +4 );
    cout << a.arrayPairSum(nums) << endl;
    system("pause");
}