水题,判断一个字符串中的每个字符是否在字母表中相邻。解法是将数组排序,直接判断下一个字符是否为当前字符+1
#include<bits/stdc++.h>
using namespace std;
int n;
string s;
int main()
{
while (cin >> n) {
for (int j = 0; j < n; j++) {
int ok = 0;
cin >> s;
char c[s.length()];
strcpy(c, s.c_str());
sort(c, c+s.length());
for (int i = 0; i < s.length()-1; i++) {
if (c[i+1] != c[i]+1) {
cout << "No" << endl;
ok = 1;
break;
}
}
if (!ok)
cout << "Yes" << endl;
}
}
return 0;
}