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₁. 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 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 S_​1−S_​2 in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

题⽬⼤意：

给出两个字符串，在第⼀个字符串中删除第⼆个字符串中出现过的所有字符并输出

分析：

⽤cha[256]数组变量标记str1出现过的字符为true，str2出现过的字符为false,输出str1的时候根据cha[str1[i]]是否为true,如果是true就输出

//1050 String Subtraction (20分) 
#include <iostream>
#include <string>
using namespace std; 
bool cha[256];

int main() 
{
	string s1,s2;
	getline(cin,s1);
	getline(cin,s2);
	for(int i=0;i<s1.size();i++)
	{
		cha[s1[i]]=true;
	}
	for(int i=0;i<s2.size();i++)
	{
		cha[s2[i]]=false;
	}
	for(int i=0;i<s1.size();i++)
	{
		if(cha[s1[i]])
			cout<<s1[i];
	}
	return 0;
}