1112 Stucked Keyboard (20point(s)) - C语言 PAT 甲级

1112 Stucked Keyboard (20point(s))

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

题目大意：

有些按键损坏，输入正整数 K，表示按一次会重复 K 次，输入一段字符，根据字符串，寻找损坏的键，

按照坏键发现的顺序输出坏键，并按照正常按键输出修正后的字符串

设计思路：

• 预先假设所有键盘都坏了，根据字符串标记好的键
• 只要有一次 （连续相同字符）% K != 0 就说明此键是好的

注意：

• 如果预先假设键盘良好，进而标记坏键，其实依旧需要标记遍历过程中发现的好键，例如，输入 2 abaa
• 仅标记坏键的话，会误判 a 为坏键
• 这是因为不能依据一次坏记录，就判断按键已坏，所有次记录都是坏的，才能判断已坏，
• 而判断好键则相反，一次好记录就足以说明是好键

编译器：C (gcc)

#include <stdio.h>
#include <string.h>

int main(void)
{
        char str[1010] = {'\0'};
        int k;
        int flag[128] = {0};// 0 huai le
        int i, j, len;

        scanf("%d %s", &k, str);
        len = strlen(str);
        for (i = 0; i < len; i++) {
                j = i + 1;
                while (j < len && str[j] == str[i])
                        j++;
                if ((j - i) % k != 0)
                        flag[str[i]] = 1;
                i = j - 1;
        }
        int out[128] = {0};
        for (i = 0; i < len; i++) {
                if (flag[str[i]] == 0 && out[str[i]] == 0) {
                        printf("%c", str[i]);
                        out[str[i]] = 1;
                }
        }
        puts("");
        for (i = 0; i < len; i++) {
                printf("%c", str[i]);
                if (flag[str[i]] == 0)
                        i += (k - 1);
        }
        return 0;
}