PAT 甲级 1050 String Subtraction (20分)

最新推荐文章于 2024-07-16 05:02:51 发布

哇吖吖

最新推荐文章于 2024-07-16 05:02:51 发布

阅读量71

点赞数

分类专栏： PAT甲级文章标签：字符串

本文链接：https://blog.csdn.net/qq_44408319/article/details/105859117

版权

PAT甲级专栏收录该内容

17 篇文章 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.

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<iostream>
#include<string>
#include<map>

using namespace std;

map<char,int>sign;

int main(){
    string first,second;
    getline(cin,first);
    getline(cin,second);
    for(int i=0;i<second.size();i++){
        sign[second[i]]=1;
    }
    for(int i=0;i<first.size();i++){
        if(sign[first[i]]==1){
            continue;
        }else{
            cout<<first[i];
        }
    }
    return 0;
}