题目描述
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 - S2for any given strings. However, it might not be that simple to do it fast.
输入
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.
输出
For each test case, print S1 - S2 in one line.
样例输入
They are students.
aeiou
样例输出
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 - S2for any given strings. However, it might not be that simple to do it fast.
输入
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.
输出
For each test case, print S1 - S2 in one line.
样例输入
They are students.
aeiou
样例输出
Thy r stdnts.
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s1, s2; int i; int a = 0;;
while (getline(cin, s1)&& getline(cin, s2))
{
i = 0;
while (s2[i] != '\0')
{
do
{
a = s1.find(s2[i]);
if (a < 0)//这个地方要注意,find返回来的是位置,找不到时返回-1,为了防止越界必须在这儿加个判断
break;
s1.erase(a,1);
} while (a >= 0);
i++;
}
cout << s1 << endl;
}
}
/*把这题发出来是因为我对string容器的erase方法有个误解,以为删除单个元素时传入参数为位置,其实不是,而是迭代器,这个是其逻辑地址
但可以用删区间的方法代替,位置和区间长度为1即可等效*/