PAT(甲) 1050 String Subtraction (20 分)

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.

每一个ASCII字符对应于与0~255的整数，所以可以用bool类型数组对其赋值，进行标志。S2字符串里的字符均赋值为true，对S1进行输出处理，如S1字符串单个字符对应的标志数字里的值为true，则不输出，反之，则输出！ 

#include<iostream>

#include<string>

using namespace std;

int main(){

    string s1, s2;

    getline(cin, s1);

    getline(cin, s2);

    bool flag[256] = {false};

    for(int i = 0; i < s2.length(); i++){

        flag[s2[i]] = true;

    }

    for(int i = 0; i < s1.length(); i++){

        if(flag[s1[i]] == false){

            cout << s1[i];

        }

    }

    return 0;

}