题目链接:https://leetcode-cn.com/problems/array-partition-i/description/
思路:选择第奇数个即可
class Solution {
public int arrayPairSum(int[] nums) {
//the sum of the mins
int sum=0;
int sizeOfNum=nums.length;
//sort first
int i,j=0;
for (i=1;i<sizeOfNum;i++){
int temp=nums[i];
for (j=i-1;j>=0&&temp<nums[j];j--){
nums[j+1]=nums[j];
}
nums[j+1]=temp;
}
//choose the odd num
for (i=0;i<sizeOfNum;i++){
if (i%2==0){
sum=sum+nums[i];
}
}
return sum;
}
}