PAT-A1084/B1029 Broken Keyboard/旧键盘题目内容及题解

最新推荐文章于 2023-02-13 22:18:25 发布

Bourbon_Whiskey_

最新推荐文章于 2023-02-13 22:18:25 发布

阅读量288

点赞数

分类专栏： PAT甲级 PAT乙级文章标签： PAT 甲级乙级 OJ 编程学习

本文链接：https://blog.csdn.net/Bourbon_Whiskey_/article/details/86766623

版权

PAT甲级同时被 2 个专栏收录

156 篇文章 3 订阅

订阅专栏

PAT乙级

33 篇文章 0 订阅

订阅专栏

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.

输入在 2 行中分别给出应该输入的文字、以及实际被输入的文字。每段文字是不超过 80 个字符的串，由字母 A-Z（包括大、小写）、数字 0-9、以及下划线 _（代表空格）组成。题目保证 2 个字符串均非空。

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

解题思路

读入两个字符串；
建立与字符串对应的哈希表；
对两个字符串进行遍历，遍历过程中遇到一致的两个指针均后移一位，如果遇上不一致的则将第一个字符串指针所指内容查哈希表，如未遇到过则哈希置1，并将其加入结果字符串，如果遇到过则跳过，指针前进一位；
直到第一个字符串的指针到达结尾；
输出结果并返回零值。

代码

#include<stdio.h>

#define maxn 128

int HashTable[maxn];
char res[maxn];

int main(){
    char s1[maxn],s2[maxn];
    int num=0;
    int i=0,j=0;
    scanf("%s%s",&s1,&s2);
    while(s1[i]!=0){
        if(s1[i]==s2[j]){
            i++;
            j++;
        }else{
            if(s1[i]>='a'&&s1[i]<='z'){
                if(HashTable[s1[i]]==0){
                    res[num++]=s1[i]-32;
                    HashTable[s1[i]]=1;
                    HashTable[s1[i]-32]=1;
                }
            }else if(s1[i]>='A'&&s1[i]<='Z'){
                if(HashTable[s1[i]]==0){
                    res[num++]=s1[i];
                    HashTable[s1[i]]=1;
                    HashTable[s1[i]+32]=1;
                }
            }else if(s1[i]>='0'&&s1[i]<='9'){
                if(HashTable[s1[i]]==0){
                    res[num++]=s1[i];
                    HashTable[s1[i]]=1;
                }
            }else if(s1[i]=='_'){
                if(HashTable[s1[i]]==0){
                    res[num++]=s1[i];
                    HashTable[s1[i]]=1;
                }
            }
            i++;
        }
    }
    printf("%s\n",res);
    return 0;
}