【笨方法学PAT】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_es

Sample Output:

7TI

二、题目大意

现在给出应该输入的一段文字、以及实际被输入的文字，请你列出坏掉的那些键

三、考点

string、map或者hash

四、注意

1、可以直接toupper变成大写；

2、使用map或者hash存储出现的字符；

3、使用set保存坏掉的键，但set会自动排序，需要一边存储，一边输出。

五、代码

#include<iostream>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
int main() {
	//read
	string s1, s2;
	cin >> s1 >> s2;

	//toupper and build map
	unordered_map<char, int> un_map;
	for (int i = 0; i < s1.length(); i++)
		s1[i] = toupper(s1[i]);
	for (int i = 0; i < s2.length(); i++) {
		s2[i] = toupper(s2[i]);
		un_map[s2[i]] = 1;
	}
	
	//solve and output
	set<char> sset;
	for (int i = 0; i < s1.length(); ++i) {
		if (un_map[s1[i]] == 0) {
			if (sset.find(s1[i]) == sset.end()) {
				sset.insert(s1[i]);
				cout << s1[i];
			}
		}
	}

	system("pause");
	return 0;
}