1050 String Subtraction（20 分）

最新推荐文章于 2022-02-10 17:16:46 发布

galesaur_wcy

最新推荐文章于 2022-02-10 17:16:46 发布

阅读量277

点赞数

分类专栏： PAT甲级题

本文链接：https://blog.csdn.net/galesaur_wcy/article/details/82492185

版权

PAT甲级题专栏收录该内容

145 篇文章 3 订阅

订阅专栏

1050 String Subtraction（20 分）

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.

代码：

#include<bits/stdc++.h> 
using namespace std;
const int maxn = 1e4 + 10;
map<char,int>mp;
int main()
{
	char s1[maxn],s2[maxn];
	scanf("%[^\n]%c",&s1);
	scanf("%[^\n]%c",&s2);
	int len = strlen(s2);
	for(int i = 0 ; i < len; i++)
		mp[s2[i]] = 1;
	len = strlen(s1);
	for(int i = 0 ; i < len ; i++)
	{
		if(mp[s1[i]] == 0)
			putchar(s1[i]);
	}
	putchar('\n');
	return 0;
}