题目链接: 2014-09-1 相邻数对.
code
#include <iostream>
#include <algorithm> //引入sort函数
using namespace std;
int main() {
int n;
cin >> n;
int* nums = new int[n];
for (int i = 0; i < n; i++)
cin >> nums[i];
sort(nums, nums + n);
int count = 0;
for(int i=0; i<n-1; i++)
if (nums[i] - nums[i + 1] == -1) {
count++;
}
cout << count << endl;
delete[] nums;
return 0;
}