1050 String Subtraction （20 分）

1050 String Subtraction （20 分）

Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task is simply to calculate S​1​​−S​2​​ 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​1​​ and S​2​​, 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​1​​−S​2​​ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

这题很简单只要用remove和erase就能达成目的。具体可以看https://www.cnblogs.com/7z7chn/p/6341453.html

#include <iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(int argc, char** argv)
{
	string s1,s2,s3;
	getline(cin,s1); 
	getline(cin,s2);
	for(int i=0;i<s2.length();i++)
	{
		s1.erase(remove(s1.begin(),s1.end(),s2.at(i)),s1.end());
	}
	cout<<s1<<endl;
	
	return 0;
}