1084 Broken Keyboard

xumingyukou

于 2022-02-08 17:25:33 发布

阅读量335

点赞数

分类专栏： PAT甲级文章标签：散列表 c++

本文链接：https://blog.csdn.net/weixin_44230791/article/details/122828104

版权

PAT甲级专栏收录该内容

74 篇文章 0 订阅

订阅专栏

该程序旨在解决因键盘按键磨损导致输入字符丢失的问题。它通过比较原本要输入的字符串与实际输入的字符串，找出那些在原本字符串中出现但未在实际输入中出现的字符，从而确定哪些按键可能已经磨损。程序首先读取两串字符串，然后遍历原本的字符串，如果在实际输入的字符串中找不到对应的字符，则认为该字符对应的按键磨损。最后输出磨损的按键。

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

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

#include<cstdio>
#include<cstring>
using namespace std;

char original[85];
char out[85];

int main()
{
  scanf_s("%s", &original, sizeof(char) * 85);
  scanf_s("%s", &out, sizeof(char) * 85);
  int len_of_ori = strlen(original);
  int len_of_out = strlen(out);
  bool hashTable[128] = { false };  //用来标记字符已经被输出
  for (int i = 0; i < len_of_ori; i++)
  {
    int j;
    char c1, c2;
    for (j = 0; j < len_of_out; j++)
    {
      c1 = original[i];
      c2 = out[j];
      if (c1 >= 'a' && c1 <= 'z')
      {
        c1 -= 32;
      }
      if (c2 >= 'a' && c2 <= 'z')
      {
        c2 -= 32;
      }
      if (c1 == c2)
        break;
    }
    if (j == len_of_out && hashTable[c1] == false)
    {
      printf("%c", c1);
      hashTable[c1] = true;
    }
  }
}