<easy>LeetCode Problem -- 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 = min(1, 2) + min(3, 4).

• 分析：这道题要求对于一个长度为2n的数组进行两两分组，使得分组之后的中每组中最小值之和尽可能的大。

• 思路一：要使得和尽可能的大，则要取到这个数组中尽可能大的值来进行求和运算。因此可以先对数组进行排序，然后将数组第2k的值进行相加。（k = 0, 1, 2,…）

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int sum = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (i % 2 != 0) continue;
            else sum = sum + nums[i];
        }
        return sum;
    }
};