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 104. 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.
题目大意
这题就是给出两个字符串,然后把第一个字符串中在第二个字符串里出现的字符去掉之后再输出即可。
个人思路
这题是散列算法的应用,将第二个字符串中的所有字符是否出现映射在一个bool型 数组中,如果第一个字符串中的字符被标记了则不输出,否则则输出。
代码实现
#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iostream>
#define ll long long
#define eps 1e-8
#define INF 0x7FFFFFFF
using namespace std;
int main() {
// 输入
string s1, s2;
getline(cin, s1);
getline(cin, s2);
// 初始化映射数组
bool flag[200];
memset(flag, 0, sizeof(flag));
// 标记s2中出现的字符
for (int i = 0; i < s2.length(); i ++) {
flag[s2[i]] = true;
}
// 将s1中未被标记的字符输出
for (int i = 0; i < s1.length(); i ++) {
if (!flag[s1[i]]) cout << s1[i];
}
return 0;
}
总结
学习不息,继续加油