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. aeiouSample Output:
Thy r stdnts. 思路:题目的要求是在s1字符串中消除掉s2字符串里面所有的字符,用find直接判定s1的每个字符是否在s2中可能会超时。考虑到ASCII值得范围,我们可以利用类似hash的判定数组来判定。#include <iostream> #include <string> using namespace std; int main() { int a[200] = {0}; string s1, s2; getline(cin, s1); getline(cin, s2); for (int i=0; i!=s2.size(); ++i) //要删除的字符的ASCII值设为1 a[s2[i]] = 1; for (int i=0; i!=s1.size(); ++i) if (!a[s1[i]]) //当字符不是要删除的才输出 cout << s1[i]; cout << endl; //system("pause"); return 0; }