1112 Stucked Keyboard (20 分)

本文介绍了一种算法,用于检测并修正由坏键盘造成的重复字符问题。通过分析屏幕上的输出字符串,算法能够识别哪些键可能被卡住,并输出修正后的原始字符串。该方法对于处理因键盘故障导致的文本输入错误非常有效。

摘要生成于 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 emight 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

 思路 :  要求出坏键,可以遍历一遍,在遍历的过程中,如果出现重复的字符串,如果是坏键,那么重复的个数一定是k的整数倍 . 故可设置map来标记是否为坏串,在输出原串时,若是坏键,则跳过坏键个数进行输出。

#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define x first
#define y second
int k;
string s;
map<char,bool> mp1,mp2;
int main()
{
    cin>>k>>s;
    int len=s.length();
    for(int i=0;i<len;i++)
    {
        int cnt=1;
        while(s[i]==s[i+1]&&i<len)
        {
            i++; cnt++;
        }
        if(cnt%k==0) mp1[s[i]]=true;
        else  mp1[s[i]]=false;
    }
    for(int i=0;i<len;i++)
    {
        if(mp1[s[i]]&&!mp2[s[i]])
        {
            cout<<s[i];
            mp2[s[i]]=true;
        }
    }
    cout<<endl;
    int i=0;
    while(i<len)
    {
        if(mp1[s[i]])
        {
            cout<<s[i];
            i+=k;
        }
        else
        {
          cout<<s[i]; i++;
        }
    }
    cout<<endl;
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值