PAT-A1050-String Subtraction

PAT String Subtraction - 题目链接

---

题目描述

 Given two strings S 1​ and S 2 , S=S 1​ −S 2 is defined to be the remaining string after taking all thecharacters 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.

输入描述

 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.

---

解题思路

 利用散列的思想，这里一共有128个字符，我们建立个bool类型的数组，初始化全部为false,之后遍历第二个字符串，如果在第二个字符串中出现就将数组变成true,在输出第一个字符串的时候不能够在输出该字符。

参考代码

#include <iostream>
#include <cstring>

using namespace std;
bool HashTable[128];

int main() {
    string str1, str2;
    getline(cin, str1);//建议gets换成getline
    memset(HashTable, false, sizeof(HashTable)); //初始化布尔数组
    getline(cin, str2);
    for (auto i:str2) { //auto循环遍历
        HashTable[i] = true;
    }
    for (auto i:str1) {
        if (!HashTable[i]) {//输出没有出现过的字符
            cout << i;
        }
    }
    return 0;
}