PAT甲级-1050 String Subtraction (20分)

最新推荐文章于 2024-10-11 05:06:51 发布

邂逅模拟卷

最新推荐文章于 2024-10-11 05:06:51 发布

阅读量216

点赞数

分类专栏： # PAT 文章标签： c++ 算法

本文链接：https://blog.csdn.net/qq_34451909/article/details/105584794

版权

PAT 专栏收录该内容

164 篇文章 77 订阅

订阅专栏

点击链接PAT甲级-AC全解汇总

题目：
Given two strings S₁ and S₂ , S=S₁ −S₂ is defined to be the remaining string after taking all the characters in S₂ from S₁ . Your task is simply to calculate S₁ −S₂ 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₁ and S₂ , respectively. The string lengths of both strings are no more than 10⁴ . 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₁ −S₂ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

题意：
输入一行字符串，和要过滤的字母，输出过滤后的结果。

我的代码：

#include<bits/stdc++.h>
using namespace std;

int main(){
    string str;
    getline(cin,str);
    set<char>ignore;
    char c;
    while((c=getchar())!='\n') ignore.insert(c);
    for(int i=0;i<str.length();i++)    
        if(ignore.find(str[i])==ignore.end())cout<<str[i];    
    return 0;
}