ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.
Now, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?
The first and only line of the input contains a single string s (1 ≤ |s| ≤ 50 000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember.
If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print - 1 in the only line.
Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks replaced with uppercase English letters.
If there are multiple solutions, you may print any of them.
ABC??FGHIJK???OPQR?TUVWXY?
ABCDEFGHIJKLMNOPQRZTUVWXYS
WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO
-1
??????????????????????????
MNBVCXZLKJHGFDSAQPWOEIRUYT
AABCDEFGHIJKLMNOPQRSTUVW??M
-1
In the first sample case, ABCDEFGHIJKLMNOPQRZTUVWXYS is a valid answer beacuse it contains a substring of length 26 (the whole string in this case) which contains all the letters of the English alphabet exactly once. Note that there are many possible solutions, such as ABCDEFGHIJKLMNOPQRSTUVWXYZ or ABCEDFGHIJKLMNOPQRZTUVWXYS.
In the second sample case, there are no missing letters. In addition, the given string does not have a substring of length 26 that contains all the letters of the alphabet, so the answer is - 1.
In the third sample case, any string of length 26 that contains all letters of the English alphabet fits as an answer.
直接暴力搜索每26个一次即可,详细见代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
string s;
int cnt[200];
int q;
int main(){
cin>>s;
int i,j;
int solve = 0;
for(i = 0; s[i]; i++){
memset(cnt,0,sizeof(cnt));//初始化cnt数组
q = 0;//记录问号的个数
for(j = i; s[j]&&j < i+26; j++){
if(s[j]>='A'&&s[j]<='Z')cnt[s[j]]++;//计算一个26长的串中字母出现的次数
if(s[j]=='?')q++;//计算问号的个数
}
if(j!=i+26)break;//如果没到26个终止了,说明这个串长度不够26,一定不符合了所以终止。
int flag = 0;
for(j = 'A'; j <= 'Z'; j++){
if(cnt[j]==0)q--;
if(cnt[j]>1){
flag = 1;//判断如果一个字母出现了两次或以上,肯定不可以了,跳过这次
break;
}
}
if(flag)continue;
if(q==0){//如果q恰好为零说明问号个数正好匹配了没用到的字母个数,所以是存在的
for(j = i; j < i+26; j++){
if(s[j]=='?'){
int k;
for(k = 'A'; k <= 'Z'; k++){
if(cnt[k]==0){
cnt[k] = 1;
s[j] = k;//通过遍历赋值即可
break;
}
}
}
}
solve = 1;//赋值为一代表解决了
break;
}
}
if(!solve){//solve为零说明没有解
cout << -1 << endl;
return 0;
}
for(i = 0; s[i]; i++){
if(s[i]=='?')s[i] = 'A';//其余问号直接赋值为A即可
}
cout << s << endl;
return 0;
}