PAT 甲级散列 1084 Broken Keyboard (20 分)

灰太狼 2024-02-19 21:37 57阅读 0赞

## 1084 Broken Keyboard (20 分) ##

On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.

Now given a string that you are supposed to type, and the string that you actually type out, please list those keys which are for sure worn out.

#### Input Specification: ####

Each input file contains one test case. For each case, the 1st line contains the original string, and the 2nd line contains the typed-out string. Each string contains no more than 80 characters which are either English letters \[A-Z\] (case insensitive), digital numbers \[0-9\], or `_` (representing the space). It is guaranteed that both strings are non-empty.

#### Output Specification: ####

For each test case, print in one line the keys that are worn out, in the order of being detected. The English letters must be capitalized. Each worn out key must be printed once only. It is guaranteed that there is at least one worn out key.

#### Sample Input: ####

7_This_is_a_test
    _hs_s_a_es

#### Sample Output: ####

7TI

#include<iostream>
    #include<algorithm>
    #include<map>
    #include<cstring>
    #include<ctype.h>
    using namespace std;
    int main()
    {
    	char a[81],b[81];
    	string c;
    	int i,j,len1,len2,k;
    	map<char,int> d;
    	cin>>a;
    	cin>>b;
        len1=strlen(a);
        len2=strlen(b);
        for(i=0,j=0;i<len1&&j<len2;)
        {
    //    	cout<<a[i]<<"  "<<b[j]<<endl;
        	if(a[i]==b[j])
        	{
    			i++;
    			j++;
    		}
    		else
        	if(b[j]!=a[i])
        	{
        		a[i]=toupper(a[i]);
        		if(d.count(a[i])==0)
        		{
        			d.insert(make_pair(a[i],1));
    	    		c+=a[i];
    			}
        		i++;
    		}
    	}
    	if(i<len1)
    	for(k=i;k<len1;k++)
    	{
    		a[k]=toupper(a[k]);
    		if(d.count(a[k])==0)
    		c+=a[k];
    	}
    	if(j<len2)
    	for(k=j;k<len2;k++)
    	{
    		a[k]=toupper(a[k]);
    		if(d.count(a[k])==0)
    		c+=b[k];
    	}
    	cout<<c<<endl;
    	return 0;
     }