PAT A1112 Stucked Keyboard （20 分）——字符串

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.

Now given a resulting string on screen, you are supposed to list all the possible stucked keys, and the original string.

Notice that there might be some characters that are typed repeatedly. The stucked key will always repeat output for a fixed k times whenever it is pressed. For example, when k=3, from the string thiiis iiisss a teeeeeest we know that the keys i and e might be stucked, but s is not even though it appears repeatedly sometimes. The original string could be this isss a teest.

Input Specification:

Each input file contains one test case. For each case, the 1st line gives a positive integer k (1<k≤100) which is the output repeating times of a stucked key. The 2nd line contains the resulting string on screen, which consists of no more than 1000 characters from {a-z}, {0-9} and _. It is guaranteed that the string is non-empty.

Output Specification:

For each test case, print in one line the possible stucked keys, in the order of being detected. Make sure that each key is printed once only. Then in the next line print the original string. It is guaranteed that there is at least one stucked key.

Sample Input:

3
caseee1__thiiis_iiisss_a_teeeeeest

Sample Output:

ei
case1__this_isss_a_teest

 

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <set>
using namespace std;
int n,k,m;
set<char> good,bad,pr;
queue<char> q;
int main(){
    scanf("%d",&n);
    string s;
    cin>>s;
    for(int i=0;i<s.length()-n+1;i++){
        char now=s[i];
        int flag=0;
        for(int j=1;j<n;j++){
            if(s[i]!=s[j+i]){
                good.insert(now);
                flag=1;
                break;
            }
        }
        if(flag==1){
            if(bad.find(now)!=bad.end())bad.erase(bad.find(now));
            continue;
        }
        if(good.find(now)==good.end())bad.insert(now),i=i+n-1;
    }
    for(int i=0;i<s.length();i++){
        if(bad.find(s[i])!=bad.end() && pr.find(s[i])==pr.end())printf("%c",s[i]),pr.insert(s[i]);
    }
    printf("
");
    for(int i=0;i<s.length();i++){
        if(bad.find(s[i])==bad.end())printf("%c",s[i]);
        else{
            printf("%c",s[i]);
            i=i+n-1;
        }
    }
}

注意点：看似简单，实际上还蛮复杂的。看了大佬的思路都是看重复的个数是不是n的倍数，再来判断。但总感觉都落下了一个考虑点，一开始认为是坏的，其实后面证明是好的，这个好像都没有考虑。