PAT甲级——1112 Stucked Keyboard (字符串+stl)

此文章同步发布在我的CSDN上：https://blog.csdn.net/weixin_44385565/article/details/90041078

1112 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

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

Input Specification:

Each input file contains one test case. For each case, the 1st line gives a positive integer

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

题目大意：键盘有些按键是坏的，每当按该按键时，对应的字符就会重复输入k的倍数次，保证坏的每一个按键都会重复k的倍数次。现在给定一串用该键盘打出的字符，要求找出坏掉的按键对应的字符，按照遇到的先后顺序不重复地输出，然后再输出原本的字符串。

思路：读取字符串str，第一次遍历字符串str，重复次数不为k的倍数的字符按键确定没坏，用notKey标记（unordered_map），只有重复次数为k的整数倍且未被notKey标记过的字符才是坏掉的按键，用isKey标记。需要注意的是每次标记notKey之后都要对isKey进行标记，不然测试点1就过不掉~~遍历完字符串后要记得对最后一个元素进行判断。

第二次遍历字符串str，借助set将符合要求的元素不重复地按遇到的顺序放入字符数组key，同时将坏掉的按键对应的字符多余的部分在str里替换为‘#’（任意输入中不包含的字符），输出的时候遇到‘#’跳过就行~

这题说难也不难，说不难也卡了我很长时间，比起各种数据结构和算法，我更害怕这种字符串操作的类型，怎么说呢，做出来没有成就感，卡bug又让人奔溃。。。

 1 #include<iostream>
 2 #include<unordered_map>
 3 #include<set>
 4 using namespace std;
 5 unordered_map<char,bool> isKey,notKey;//notKey是确定没问题的按键 
 6 set<char> S;
 7 char str[1001],key[1001];
 8 int main()
 9 {
10     int len,k,cnt=1,pre=0,i;
11     scanf("%d%s",&k,str);
12     for(i=1;str[i]!='';i++){
13         if(str[pre]==str[i]){
14             cnt++;
15         } 
16         else{
17             if(cnt%k!=0){
18                 notKey[str[pre]]=true;
19             }
20             else{
21                 if(notKey[str[pre]]){
22                     isKey[str[pre]]=false;
23                 }
24                 else
25                     isKey[str[pre]]=true;
26             }
27             if(notKey[str[pre]])//少了这步操作测试点1就过不了
28                 isKey[str[pre]]=false;
29             cnt=1;
30         }
31         pre=i;
32     }
33     len=i;
34     if(cnt%k==0&&!notKey[str[pre]])
35         isKey[str[pre]]=true;
36     if(cnt==1){
37         isKey[str[pre]]=false;
38     }
39     cnt=0;
40     i=0;
41     while(i<len){
42         if(isKey[str[i]]){
43             if(S.empty()||S.find(str[i])==S.end()){
44                 S.insert(str[i]);
45                 key[cnt]=str[i];
46                 cnt++;
47             }
48             int j=i+k,m;
49             while(str[j]==str[i]&&j<len) j+=k;
50             for(m=i+(j-i)/k;m<j;m++)
51                 str[m]='#';
52             i=j;
53         }
54         else
55             i++;
56     }
57     key[cnt]='';
58     printf("%s
",key);
59     for(i=0;i<len;i++){
60         if(str[i]!='#')
61             printf("%c",str[i]);
62     }
63     printf("
");
64     return 0;
65 }