PAT-1050 String Subtraction

最新推荐文章于 2025-06-17 13:41:13 发布

原创最新推荐文章于 2025-06-17 13:41:13 发布 · 308 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#pat

浙大PAT-Advanced 专栏收录该内容

119 篇文章

订阅专栏

本文介绍了一种高效计算两个字符串相减的方法，通过遍历第一个字符串并检查其字符是否存在于第二个字符串中来实现。文章提供了完整的C++代码示例，展示了如何从一个字符串中移除另一个字符串的所有字符。

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.

注意OJ上读取一行最方便的方法cin.getline(char* ,maxSize)

#include<stdio.h>
#include<iostream>
using namespace std;

char c1[10005];
char c2[10005];

int main(){

	cin.getline(c1,10002);
	cin.getline(c2,10002);

	for(int i=0;c1[i]!='\0';i++){
		bool ok=true;
		for(int j=0;c2[j]!='\0';j++){
			if(c2[j]==c1[i]){
				ok=false;break;
			}
		}
		if(ok)printf("%c",c1[i]);
	}

	return 0;
}