1084 Broken Keyboard (20 分)

最新推荐文章于 2025-12-31 19:32:08 发布

原创最新推荐文章于 2025-12-31 19:32:08 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c语言 #散列 #c++ #数据结构

C++ 同时被 2 个专栏收录

54 篇文章

订阅专栏

PTA

36 篇文章

订阅专栏

该程序旨在识别破损键盘上无法正常显示的字符。给定原始字符串和实际输入的字符串，通过比较找出那些在输入中缺失的字符，即为破损的键盘键。示例中，输入的原始字符串是'7_This_is_a_test'，实际输入为'_hs_s_a_es'，输出为'TI'，表明'T'和'I'键已损坏。

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<string.h>
#include<stdio.h>
using namespace std;
string init,Break;
int Break_hash[40];
int main()
{
    cin>>init>>Break;
    //散列表初始化
    for(int i=0;i<40;i++)
        Break_hash[i]=0;
    //处理坏键盘对应的散列数组
    for(int i=0;i<Break.length();i++)
    {
        if(isupper(Break[i]))
            Break_hash[Break[i]-'A']++;
        else if(islower(Break[i]))
            Break_hash[Break[i]-'a']++;
        else if(Break[i]>='0'&&Break[i]<='9')
            Break_hash[Break[i]-'0'+26]++;
        else
            Break_hash[36]++;
    }
    //处理原始字符串
    for(int i=0;i<init.length();i++)
    {
        if(isupper(init[i])&&Break_hash[init[i]-'A']==0){
            //这句没有会重复输出
            Break_hash[init[i]-'A']++;
            printf("%c",init[i]);
        }   
        else if(islower(init[i])&&Break_hash[init[i]-'a']==0){
            printf("%c",init[i]-32);
            Break_hash[init[i]-'a']++;
        }
        else if((init[i]>='0'&&init[i]<='9')&&Break_hash[init[i]-'0'+26]==0){
            printf("%c",init[i]);
            Break_hash[init[i]-'0'+26]++;
        }
        else if(Break_hash[36]==0){
            Break_hash[36]++;
            printf("_");
        }
    }
    return 0;
}