思路:先将数组排序,然后取奇位便可
class Solution {
public:
int arrayPairSum(vector<int>& nums)
{
int i;
int ret = 0;
sort(nums.begin(), nums.end());
for(i = 0;i < nums.size();i+=2)
ret += nums[i];
return ret;
}
};