1050 String Subtraction (20分)

Given two strings S₁ and S₂​​ , S=S₁​​ −S₂​​ is defined to be the remaining string after taking all the characters in S₂​​ from S₁
​​ . Your task is simply to calculate S₁−S₂ for any given strings. However, it might not be that simple to do it fast.

Input Specification:

Each input file contains one test case. Each case consists of two lines which gives S₁​​ and S₂​​ , respectively. The string lengths of both strings are no more than 10^​4​​ . It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:

For each test case, print S₁​​ − S₂ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

---

#include<iostream>
#include<string>
#include<cstring>

using namespace std;

bool hashTable[128] = {false};

int main(){
	string S1, S2;
	getline(cin, S1);
	getline(cin, S2);
	int len1 = S1.size();
	int len2 = S2.size();
	for(int i = 0; i < len2; i++){
		hashTable[S2[i]] = true;
	}
	for(int i = 0; i < len1; i++){
		if(hashTable[S1[i]] == false){
			cout << S1[i];
		}
	}
	cout << endl;
    return 0;
}