原题目:
原题链接:https://www.patest.cn/contests/pat-a-practise/1084
###Broken Keyboard (20)
On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.
Now given a string that you are supposed to type, and the string that you actually type out, please list those keys which are for sure worn out.
Input Specification:
Each input file contains one test case. For each case, the 1st line contains the original string, and the 2nd line contains the typed-out string. Each string contains no more than 80 characters which are either English letters [A-Z] (case insensitive), digital numbers [0-9], or _ (representing the space). It is guaranteed that both strings are non-empty.
Output Specification:
For each test case, print in one line the keys that are worn out, in the order of being detected. The English letters must be capitalized. Each worn out key must be printed once only. It is guaranteed that there is at least one worn out key.
Sample Input:
7_This_is_a_test
_hs_s_a_esSample Output:
7TI
题目大意
一个坏键盘,有些按键会失灵。
输入是目的字符串和实际字符串。
输出是坏掉的按键
解题报告
同步遍历目的字符串和实际字符串,遇到不同则输出按键位置。
注意事项:
- 每个按键只输出一次
- 输出全大写
代码
#include "iostream"
#include "string"
#include "map"
using namespace std;
map<char,bool> isPrinted;
void printC(char c){
if(c >= 'a' && c <= 'z')
c = c + 'A' - 'a';
if(isPrinted[c])
return;
printf("%c",c);
isPrinted[c] = true;
}
int main(){
string a,b;
cin>>a>>b;
int l1 = a.length(),l2 = b.length(),i,j;
for(i = 0, j = 0;i < l1;){
if(j >= l2){
printC(a[i++]);
continue;
}
if(a[i] == b[j]){
i++;
j++;
}else
printC(a[i++]);
}
system("pause");
}