1050 String Subtraction (20分)

多一些不为什么的坚持啊

于 2020-01-04 13:58:46 发布

阅读量91

点赞数

本文链接：https://blog.csdn.net/weixin_43850619/article/details/103832594

版权

PAT 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

String Subtraction

Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking all the characters in S2from 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.

AC代码

#include<iostream>
using namespace std;
int main(){
	string s1, s2;
	getline(cin, s1);
	getline(cin, s2); 
	for(int i = 0; i < s1.length(); i++){
		int flag = 1;
		for(int j = 0; j < s2.length(); j++){
			if(s1[i] == s2[j]){
				flag = 0;
				break;
			}
		}
		if(flag){
			cout << s1[i];
		}
	}
	return 0;
}