官网
1084. Broken Keyboard (20)
时间限制
200 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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_es
Sample Output:
7TI
题目大意
- 1.给你俩行字符串,找出第一行有的二行没有的那些字符,并且每个字符只能被打印一次,且按照的是检查的顺序输出。
解题思路
- 1.我是在俩个字符串后面加一个’+’号,然后再比较输出。
- 2.原来’_’键坏了也是要输出的,还以为只要输出数字或者字母,注意这个!
AC代码
#include<iostream>
#include<string>
using namespace std;
int visited[125];
int main()
{
string a, b;
cin >> a >> b;
a = a + '+';
b = b + '+';
int k1 = 0, k2 = 0;
while (k1<a.length()&&k2<b.length())
{
if (a[k1]!=b[k2])
{
//缺空格的情况
if (visited[124] == 0 && a[k1] == '_')
{
visited[124] = 1;
cout << "_";
}
//缺数字或者字母的情况
if (a[k1] >= 'a'&&a[k1] <= 'z')
{
a[k1] = a[k1] - 'a' + 'A';
}
if (visited[(int)a[k1]] == 0 && isalnum(a[k1]))
{
visited[(int)a[k1]] = 1;
cout << (char)a[k1];
}
k1++;
}
else{
k1++;
k2++;
}
}
cout << endl;
return 0;
}