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.
分析
1 gets(str)输入,注意输入结束后,会在输入的字符串后面加个'\0'
char str[]="123456";gets(str); abc↙ str会变成abc\056
char str2[19];gets(str2); abc 12d3\n 456\0 efg↙ str变成"abc 12d3\n 456\0 789"//gets()以回车为结束符,\n、\0、空格对它没影响
而scanf(“%s”,str2); 遇到空格就会结束
2 考虑到根据s2循环遍历s1,有点麻烦,肯能又要运行超时,做了一个ASCII数组
代码
#include<stdio.h>
#define MAX 11000
int ASCII[300]={0};
int main(){
int i;
char s1[MAX],s2[MAX];
gets(s1);gets(s2);//can't use scanf() for it's string end with white space
//just gets(string) end with enter not space
for(i=0;i<strlen(s2);i++) ASCII[ s2[i] ] =1;
for(i=0;i<strlen(s1);i++) if( !ASCII[ s1[i] ] ) printf("%c",s1[i]);
}