PAT 1112 Stucked Keyboard

本文介绍了一个算法问题,针对一个损坏的键盘,某些按键总是被卡住导致输入重复字符。通过给定屏幕上的字符串,需要找出所有可能卡住的按键及原始输入的字符串。输入包括按键重复次数和屏幕上的字符串,输出则是可能的卡住按键及其原始输入。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.

Now given a resulting string on screen, you are supposed to list all the possible stucked keys, and the original string.

Notice that there might be some characters that are typed repeatedly. The stucked key will always repeat output for a fixed k times whenever it is pressed. For example, when k=3, from the string thiiis iiisss a teeeeeest we know that the keys i and e might be stucked, but s is not even though it appears repeatedly sometimes. The original string could be this isss a teest.

Input Specification:
Each input file contains one test case. For each case, the 1st line gives a positive integer k (1<k≤100) which is the output repeating times of a stucked key. The 2nd line contains the resulting string on screen, which consists of no more than 1000 characters from {a-z}, {0-9} and _. It is guaranteed that the string is non-empty.

Output Specification:
For each test case, print in one line the possible stucked keys, in the order of being detected. Make sure that each key is printed once only. Then in the next line print the original string. It is guaranteed that there is at least one stucked key.

Sample Input:
3
caseee1__thiiis_iiisss_a_teeeeeest

Sample Output:
ei
case1__this_isss_a_teest

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int times, t=0;
  string s;
  cin>>times>>s;
  char c=s[0];
  map<char, int> bkey;
  vector<char> ans;
  for(int i=0; i<s.size(); i++){
    if(s[i]==c){
      t++;
    }else{
      if(t%times==0&&bkey[c]==0){
         ans.push_back(c);
         bkey[c]=2;
      }
      else if(t%times!=0){
         if(bkey[c]==2)
            ans.erase(find(ans.begin(), ans.end(), c));
         bkey[c]=1;
      }
      c=s[i];
      t=1;
    }
  }
  if(t%times==0&&bkey[c]==0){
    ans.push_back(c);
    bkey[c]=2;
  }
  for(int i=0; i<ans.size(); i++)
    cout<<ans[i];
  cout<<endl;
  for(int i=0; i<s.size(); i++){
    cout<<s[i];
    if(bkey[s[i]]==2)
        i+=times-1;
  }
  return 0;
}

转载于:https://www.cnblogs.com/A-Little-Nut/p/9501992.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值