PAT 甲级 1050 String Subtraction (20分)

题目

1050 String Subtraction (20分)

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

Sample Output:

Thy r stdnts.

题目大意

给出两个字符串S1 和 S2， S = S1 - S2 （S是S1中去掉S2包含的字符剩下的字符组成的字符串

思路

遍历s1的时候在s2字符串中寻找s1[i]不存在则输出

代码

#include<bits/stdc++.h>
using namespace std;
int main(int argc, const char * argv[]) {
    string s1, s2;
    getline(cin, s1);
    getline(cin, s2);
    for(int i=0; i<s1.size(); i++){
        if(s2.find(s1[i]) == s2.npos)
            printf("%c", s1[i]);
    }
    return 0;
}