zoukankan      html  css  js  c++  java
  • 1112 Stucked Keyboard (20分)

    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) 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

    坏键盘:寻找连续N个数重复的是坏键

    #include <iostream>
    #include <map>
    #include <cstdio>
    #include <set>
    using namespace std;
    bool sureNoBroken[256];
    int main() {
        int k, cnt = 1;
        scanf("%d", &k);
        string s;
        cin >> s;
        map<char, bool> m;
        set<char> printed;
        char pre = '#';
        s = s + '#';
        for(int i = 0; i < s.length(); i++) {
            if(s[i] == pre) {
                cnt++;
            } else {
                if(cnt % k != 0) {
                    sureNoBroken[pre] = true;
                }
                cnt = 1;
            }
            if(i != s.length() - 1) m[s[i]] = (cnt % k == 0);
            pre = s[i];
        }
        for(int i = 0; i < s.length() - 1; i++) {
            if(sureNoBroken[s[i]] == true)
                m[s[i]] = false;
        }
        for(int i = 0; i < s.length() - 1; i++) {
            if(m[s[i]] && printed.find(s[i]) == printed.end()) {
                printf("%c", s[i]);
                printed.insert(s[i]);
            }
        }
        printf("
    ");
        for(int i = 0; i < s.length() - 1; i++) {
            printf("%c", s[i]);
            if(m[s[i]])
                i = i + k - 1;
        }
        return 0;
    }
  • 相关阅读:
    大数据集群迁移的那一夜是怎么过的
    什么是Lambda架构
    从0到1搭建自助分析平台
    业务重要?还是技术重要?
    如何从0到1搭建大数据平台
    从0到1搭建大数据平台之数据采集系统
    高频面试题:秒杀场景设计
    面试官:面对千万级、亿级流量怎么处理?
    来自朋友最近阿里、腾讯、美团等P7岗位面试题
    《我想进大厂》之JVM夺命连环10问
  • 原文地址:https://www.cnblogs.com/littlepage/p/12859842.html
Copyright © 2011-2022 走看看