1050 String Subtraction (20 分)
Given two strings S1 and S2 , S=S1−S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task is simply to calculate S1−S2 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 S1 and S2, 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 S1−S2 in one line.
Sample Input
They are students.
aeiou
Sample Output
Thy r stdnts.
题意
在S1中删除所有在S2中出现的字符。ASCII一共有256个字符,故使用大小为256的数组标记S2中的字符(散列)。
代码
#include <iostream>
using namespace std;
bool marked[256]= {false}; //标记需要删除的字符
int main() {
string s1,s2;
getline(cin,s1);
getline(cin,s2);
for(int i=0; i<s2.length(); i++) {
marked[s2[i]] = true;
}
for(int i=0; i<s1.length(); i++) {
if(!marked[s1[i]])
cout << s1[i];
}
return 0;
}