【PAT甲级 - C++题解】1084 Broken Keyboard

Pandaconda

已于 2022-11-01 18:07:16 修改

阅读量253

点赞数

分类专栏： # PAT甲级真题文章标签： c++ 算法数据结构 PAT 字符串

于 2022-09-01 23:04:18 首次发布

本文链接：https://blog.csdn.net/Newin2020/article/details/126653112

版权

PAT甲级真题专栏收录该内容

154 篇文章 8 订阅

订阅专栏

本文介绍了PAT编程竞赛中的一道题目——1084BrokenKeyboard，主要解决如何找出坏掉的键盘按键问题。通过比较原始字符串与实际输入字符串，找到不匹配的字符，从而确定哪些键可能已经磨损。文章提供了详细的解题思路和C++代码实现。

摘要由CSDN通过智能技术生成

✍个人博客：https://blog.csdn.net/Newin2020?spm=1011.2415.3001.5343
📚专栏地址：PAT题解集合
📝原题地址：题目详情 - 1084 Broken Keyboard (pintia.cn)
🔑中文翻译：坏掉的键盘
📣专栏定位：为想考甲级PAT的小伙伴整理常考算法题解，祝大家都能取得满分！
❤️如果有收获的话，欢迎点赞👍收藏📁，您的支持就是我创作的最大动力💪

1084 Broken Keyboard

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

思路

输入两个字符串 a 和 b ，并且在 b 后面加上 # 作为终止标志。
设置两个指针，i 负责遍历字符串 a ，j 负责遍历字符串 b 。
每次遍历时如果遇到小写字母，统一变成大写字母，这里用到了库函数 toupper ，能够将小写字母转换成大写字母并返回。这样，就得到了两个字符 x 和 y 。
如果 x==y ，则 i 和 j 都往后移一位。
如果 x!=y ，则说明键盘上 x 的地方坏了，如果还没有输出 x 则输出它，然后只有 i 往后移一位。

代码

#include<bits/stdc++.h>
using namespace std;

int main()
{
    string a, b;
    cin >> a >> b;

    bool st[200] = { 0 };
    b += '#'; //作为终止标志
    for (int i = 0, j = 0; i <= a.size(); i++)
    {
        char x = toupper(a[i]), y = toupper(b[j]);
        if (x == y)    j++;
        else
        {
            if (!st[x])  cout << x, st[x] = true;
        }
    }

    return 0;
}