1050 String Subtraction

最新推荐文章于 2024-07-15 22:10:26 发布

Jack.Chanel

最新推荐文章于 2024-07-15 22:10:26 发布

阅读量50

点赞数

分类专栏： PAT甲级算法文章标签：哈希算法算法

本文链接：https://blog.csdn.net/HD_TMG/article/details/128523822

版权

PAT甲级算法专栏收录该内容

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

代码长度限制

16 KB

时间限制

100 ms

内存限制

64 MB

#include <iostream>
#include <unordered_set>
using namespace std;

int main() {
    string s1,s2;
    getline(cin,s1);
    getline(cin,s2);
    unordered_set<char> hash;
    for(auto item : s2){
        hash.insert(item);
    }
    string res;
    for(auto item : s1){
        if(!hash.count(item)) res += item;
    }
    cout << res << endl;
	return 0;
}