【PAT题解集合】

1050 String Subtraction

题目详情 - 1050 String Subtraction (pintia.cn)

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
1
2

Sample Output:

Thy r stdnts.
1

思路

1. 用哈希表标记 $b$ 串中所有字符。
2. 枚举 $a$ 串中所有字符，如果当前字符在哈希表中即在 $b$ 串中已经出现过，就跳过，否则就加入 $res$ 当中。
3. 输出 $res$ 。

代码

#include
using namespace std;

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

    //将b中所有字符放入哈希表标记
    unordered_map<char, bool> st;
    for (int i = 0; i < b.size(); i++)
        st[b[i]] = true;

    //枚举a中每个字符观察是否在哈希表中出现过
    string res = "";
    for (int i = 0; i < a.size(); i++)
        if (!st.count(a[i]))
            res += a[i];
    cout << res << endl;

    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23