标签:letters string No Diverse Yes include diverse Strings
A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: “fced”, “xyz”, “r” and “dabcef”. The following string are not diverse: “az”, “aa”, “bad” and “babc”. Note that the letters ‘a’ and ‘z’ are not adjacent.
Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps.
You are given a sequence of strings. For each string, if it is diverse, print “Yes”. Otherwise, print “No”.
Input
The first line contains integer n (1≤n≤100), denoting the number of strings to process. The following n lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between 1 and 100, inclusive.
Output
Print n lines, one line per a string in the input. The line should contain “Yes” if the corresponding string is diverse and “No” if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, “YeS”, “no” and “yES” are all acceptable.
Example
Input
8
fced
xyz
r
dabcef
az
aa
bad
babc
Output
Yes
Yes
Yes
Yes
No
No
No
No
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
using namespace std;
int main(){
int n;
while(cin>>n){
while(n--){
int flag=0;
string s;
cin>>s;
set<char>q;
set<char>::iterator it;
map<char,long>p;
vector<char>v;
char cc,c;
q.clear();
for(int i=0;i<s.length();i++){
q.insert(s[i]);
v.push_back(s[i]);
p[s[i]]++;
}
sort(v.begin(),v.end());
char xx=v[0];
int i=0;
for(it=q.begin();it!=q.end();it++,i++){
if(*it!=xx+i){
flag=1;
break;
}
}
for(int i=0;i<s.size();i++){
if(p[s[i]]>1){
flag=1;
break;
}
}
if(flag==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}
标签:letters,string,No,Diverse,Yes,include,diverse,Strings
来源: https://blog.csdn.net/weixin_44417851/article/details/89059344
本站声明:
1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。