class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int res=0;
for(int n=0;n<nums.length/2;n++){
res+=Math.min(nums[2*n],nums[2*n+1]);;
}
return res;
}
}
慢呀
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int res=0;
for(int n=0;n<nums.length/2;n++){
res+=Math.min(nums[2*n],nums[2*n+1]);;
}
return res;
}
}
慢呀