PAT-A1084-Broken Keyboard

PAT Broken Keyboard - 题目链接

---

题目描述

 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.

输入描述

 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.

输出描述

 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.

---

示例：

输入

7_This_is_a_test
_hs_s_a_es

输出

7TI

---

解题思路

 1.用到散列的概念，思想是让相同的值有一个相同的对应，旧键盘输入的值和最后键盘展示的值是我们需要完成映射的值，主要难点实在如何让相同的并且没有出现的值只输出一次，这里使用了一个类似HashTable的bool类型的数组，实现字母的映射，只要是搜索到了第二个字母的最后一个并且该字符已经打印过了就将数组中的值变成true。

参考代码

#include <cstdio>
#include <cstring>

using namespace std;
bool HashTable[128];

int main() {
    char str1[100];
    char str2[100];
    memset(HashTable, false, sizeof(HashTable));
    scanf("%s", str1);    getchar();
    scanf("%s", str2);    getchar();
    int i, j;
    for (i = 0; i < strlen(str1); ++i) {
        char a = str1[i];
        for (j = 0; j < strlen(str2); ++j) {
            char b = str2[j];
            if (a >= 'a' && a <= 'z') {
                a -= 32;
            }
            if (b >= 'a' && b <= 'z') {
                b -= 32;
            }
            if (a == b) {
                break;
            }
        }
        if (j == strlen(str2) && !HashTable[a]) {
            printf("%c", a);
            HashTable[a] = true;
        }
    }


    return 0;
}