PAT A1084

思路：hash

#include<stdio.h>#include<string.h>int main(){  char str1[100],str2[100];  bool HashTable[128]={false};  gets(str1);  gets(str2);  int len1=strlen(str1);  int len2=strlen(str2);  for(int i=0;i<len1;i++)  {    int j;    char c1,c2;    for(j=0;j<len2;j++)    {      c1=str1[i];      c2=str2[j];      if(c1>='a'&&c1<='z') c1-=32;      if(c1>='A'&&c1<='Z') c1+=c2;      if(c1==c2) break;    }    if(j==len2&&HashTable[c1]==false){      printf("%c",c1);      HashTable[c1]=true;    }}  return 0;  }

点击打开链接http://www.patest.cn/contests/pat-a-practise/1084