PAT甲级 1050

题目 String Subtraction

Given two strings S1​​ 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.

解析

从s1中删除s2中的字符

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

void pat1050() {
    string a, b;
    getline(cin, a);
    getline(cin, b);
    for (int i = 0; i < a.size(); ++i) {
        bool flag = true;
        for (int j = 0; j < b.size(); ++j) {
            if (a[i] == b[j]) {
                flag = false;
                break;
            }
        }
        if (flag) {
            cout << a[i];
        }
    }
}

int main() {
    pat1050();
    return 0;
}