A1112
Description:
坏键的重复次数一定,为k,现给出k及一字符串,按探测顺序输出坏键并给出原输入字符串;
思路:
- 记录相同键出现次数:cnt,上一个键:c
- 对于每个字符,判断其与c是否相同,相同则cnt++
- 如果cnt为k的整数倍,将该字符添加至疑似vector:maybe
- 若与c不相同(此时cnt尚未变动,仍保存上一字符的cnt信息),若cnt不是k的整数倍,则确定其不是坏键,若maybe存在则移除嫌疑,保留当前字符至c,更新cnt为1
- 由于算法是处理当前字符的时候判断上一字符的情况,所以要把字符串末尾添加一个不可能输入的字符,比如"#";
- 测试三和测试五可能是由于输出顺序并非为探测顺序;
- 这样的题在考试的时候就头大了,脑子容易乱😿
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
using namespace std;
string s;
int k;
vector<char>maybe;
set<char>good;
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
scanf("%d", &k);
cin>>s;
s += "#";
char c = s[0];
int cnt = 1;
for(int i = 1; i < s.size(); i++){
if(s[i] == c){ //该键与上一键相同
cnt++;
if(cnt % k == 0){ //连续出现k次,疑似
auto it = find(maybe.begin(), maybe.end(), c);
if(good.find(s[i]) == good.end() && it == maybe.end()){ //疑似坏键
maybe.push_back(s[i]); //添加至疑似set
}
}
}else{ //该键与上一键不同
if(cnt % k != 0){ //之前键不是坏键
good.insert(c); //之前键添加至好键
//疑似坏键中移除该键
auto it = find(maybe.begin(), maybe.end(), c);
if(it != maybe.end()) maybe.erase(it);
}
c = s[i];
cnt = 1;
}
}
for(auto it = maybe.begin(); it != maybe.end(); it++)
printf("%c", *it);
cout<<endl;
for(int i = 0; i < s.size()-1; i++){
printf("%c", s[i]);
auto it = find(maybe.begin(), maybe.end(), s[i]);
if(it != maybe.end()){
i += (k-1);
}
}
return 0;
}