#1050. String Subtraction【哈希】

原题链接

Problem Description：

Given two strings $S_1$ and $S_2$，$S=S_1-S_2$ is defined to be the remaining string after taking all the characters in $S_2$ from $S_1$. Your task is simply to calculate $S_1-S_2$ 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_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.

Output Specification:

For each test case, print $S_1-S_2$ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

Problem Analysis:

遍历一遍字符串 b，将出现过的字符用哈希做标记，在遍历一遍字符串 a，将没有被标记过的字符输出即可。另外由于这里的字符串可能有空格，需要用 getline 进行读入。

Code

#include <cstdio>
#include <cstring>
#include <iostream>
#include <unordered_map>

using namespace std;

const int N = 1e4 + 10;

unordered_map<char, int> map;

int main()
{
    string a, b;
    getline(cin, a);
    getline(cin, b);

    for (int i = 0; i < b.size(); i ++ )
    {
        map[b[i]] ++ ;
    }

    for (int i = 0; i < a.size(); i ++ )
    {
        if (map[a[i]] == 0) printf("%c", a[i]);
    }
    return 0;
}