PAT A1050

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.

题意:

输入两个字符串,去除字符串1中包含字符串2的字符 ,然后输出

NOTE:

注意字符串输入方式!!!

#include <stdio.h>
#include <string.h>
int hashTable[128] = {false};
int main(){
	char str1[10010];
	char str2[10010];
	int len1 = 0;
	while(true){
		str1[len1++] = getchar();
		if(str1[len1-1] == '\n')
			break;
	}
	int len2 = 0;
	while(true){
		str2[len2++] = getchar();
		if(str2[len2-1] == '\n')
			break;
	}

	for(int i = 0; i < len2-1; i++){
		hashTable[str2[i]] = true;
	}
	for(int i = 0; i < len1-1; i++){
		if(hashTable[str1[i]] == true)
			continue;
		else
			printf("%c", str1[i]);
	}

猜你喜欢

转载自blog.csdn.net/gsj9086/article/details/86600830