PAT甲级 1050 String Subtraction(20) (字符串)

最新推荐文章于 2024-08-14 23:33:22 发布

NHS6671

最新推荐文章于 2024-08-14 23:33:22 发布

阅读量119

点赞数

分类专栏： PAT-甲级文章标签：职场和发展 c++ 算法 pat考试数据结构

本文链接：https://blog.csdn.net/NHS6671/article/details/125009099

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

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.

输入

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.

输出

For each test case, print $S_{1} -S_{2}$ , in one line.

样例输入

They are students.
aeiou

样例输出

Thy r stdnts.

题意理解

给你两个字符串

如果字符串2里面出现过的字符那么在字符串1中过滤掉它

最后输出处理好的字符串1

代码

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

string s1,s2;
unordered_map<char,int>ma;
int main(){
    getline(cin,s1);
    getline(cin,s2);
    for(int i=0;i<s2.size();i++){
        ma[s2[i]]++;
    }
    for(int i=0;i<s1.size();i++){
        if(ma.count(s1[i]))continue;
        cout<<s1[i];
    }
    return 0;
}