题目传送
题意:
给你一个有n个元素的数组,(n一定为偶数),问:这n个数是否可以全部成对的配对。配对要求为这俩个数同为奇数或者偶数或者俩数相差1.
思路:
如果数组中的元素
1.偶数的总数是2的倍数,并且奇数的总数也是2的倍数,那么一定可以完全配对,
2.如果不是,因为n是偶数的关系,那么一定是有奇数个偶数,奇数个奇数。根据配对要求,我们只要判断是否存在俩个连续的数就是了,如: 11 12,就可以配对,从而使得剩下有偶数个奇数,偶数个偶数(回到情况1)
AC代码
#include <bits/stdc++.h>
inline int read(){char c = getchar();int x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
const int N = 1e6 + 5;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-7;
const unsigned long long mod = 998244353;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
cin >> t;
while(t--)
{
ll n;
cin >> n;
ll arr[n+5] = {0},a = 0,b = 0,ans = 0,vis[110] = {0};
for(int i = 0;i < n;i++)
{
cin >> arr[i];
vis[arr[i]]++;
if(arr[i] % 2 == 0) a++;
else b++;
}
if(a % 2 == 0 && b % 2 == 0) cout << "YES" << endl;
else
{
for(int i = 2;i <= 100;i++)
if(vis[i] && vis[i-1])
{ans = 1;break;}
if(ans) cout << "YES" << endl;
else cout << "NO" << endl;
}
}
}