1084 Broken Keyboard

1084 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.

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
题目大意：键盘坏掉了，一些键无法显示。给定原本要显示的字符串，和实际显示的字符串，找出哪些键坏掉了。
分析：遍历两个字符串，i为第一个字符串计数，j为第二个字符串计数。
当(j>=s2.length()||s1[i]!=s2[j])成立时，对当前字符进行判断，如果没被输出过则输出。
相反j++;
参考代码：

#include<string>
#include<set>
#include<iostream>
using namespace std;
int main() {
	string s1, s2;
	int i = 0, j = 0;
	char ch;
	getline(cin, s1);
	getline(cin, s2);
	set<char>s;
	for (i = 0; i < s1.size(); i++) {
		if (j >= s2.size() || s1[i] != s2[j]) {
			ch = s1[i];
			if (isalpha(ch))ch = toupper(ch);
			if (s.count(ch) == 0) {
				cout << ch;
				s.insert(ch);
			}
		}
		else {	j++;}
	}
	return 0;
}