PTA：K times in the string (10分)（C语言）

最新推荐文章于 2023-12-05 08:00:00 发布

红黄蓝幼儿园

最新推荐文章于 2023-12-05 08:00:00 发布

阅读量156

点赞数 1

本文链接：https://blog.csdn.net/qq_45624989/article/details/105399594

版权

Given a positive integer K and a string (consisting of no more than 100 numbers and letters), you need to find out the first character that appears at least K times.

If such a character does not exist, output No solution .

Sample Input 1:
3 coincidance

Sample Output 1:
c

Sample Input 2:
5 pineapple

Sample Output 2:
No solution

#include <stdio.h>

int main()
{
    char str1[127] = {0};
    char str2[100];
    int k;
    int judge = 0;
    scanf("%d", &k);
    scanf("%s", &str2);
    int i, j;
    for (i = 0; str2[i] != '\0'; i++)
    {
        j = str2[i];
        str1[j]++;
    }
    for (j = 0; j <= 127; j++)
    {
        if(str1[j] == k)
        {
            printf("%c", j);
            judge = 1;
        }

    }
    if (judge == 0)
        printf("No solution");

    return 0;
}