1071 Speech Patterns (25point(s)) - C语言 PAT 甲级

1071 Speech Patterns (25point(s))

People often have a preference among synonyms of the same word. For example, some may prefer “the police”, while others may prefer “the cops”. Analyzing such patterns can help to narrow down a speaker’s identity, which is useful when validating, for example, whether it’s still the same person behind an online avatar.

Now given a paragraph of text sampled from someone’s speech, can you find the person’s most commonly used word?

Input Specification:

Each input file contains one test case. For each case, there is one line of text no more than 1048576 characters in length, terminated by a carriage return \n. The input contains at least one alphanumerical character, i.e., one character from the set [0-9 A-Z a-z].

Output Specification:

For each test case, print in one line the most commonly occurring word in the input text, followed by a space and the number of times it has occurred in the input. If there are more than one such words, print the lexicographically smallest one. The word should be printed in all lower case. Here a “word” is defined as a continuous sequence of alphanumerical characters separated by non-alphanumerical characters or the line beginning/end.

Note that words are case insensitive.

Sample Input:

Can1: “Can a can can a can? It can!”

Sample Output:

can 5

题目大意：

输入一个字符串，输出出现次数最多的单词，若有多个输出字典序最小的，

大小写字母+数字的组合视为一个单词，但统计时不区分字母大小写

设计思路：

如果有 Hash 会很简单，直接利用 Hash 表统计对应单词的个数，输出最多的即可

本题利用指针数组对单词按字典序排序，获得单词个数

• 逐个字母读入字符串，将非单词部分转换为 ‘\0’，以表示每个单词的结尾，例如：
  • Can1: “Can a can can a can? It can!”
  • can1’\0’can’\0’a’\0’can’\0’can’\0’a’\0’can’\0’it’\0’can’\0’
  • 指针数组指向每个单词的首地址，利用指针数组对单词按字典序从小到大排序，从大到小统计，然后输出

注意字符串最后要加 ‘\0’：例如下面的字符串，最后以正常单词结尾，最后要在读取完毕后额外加上 ‘\0’

• can1:!can
• can’1\0’can’\0’

编译器：C (gcc)

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

char a[1048578], *s[1048578];
int cnt;

int cmp(const void *a, const void *b)
{
        return strcmp(*((char **)a), *((char **)b));
}

int main(void)
{
        char ch, *p = &a[0];
        int i = 1;
        while ((ch = getchar()) && ch != '\n') {
                if (ch >= 'A' && ch <= 'Z') {
                        a[i++] = tolower(ch);
                } else if ((ch >= 'a' && ch <= 'z') || (ch >= '0' && ch <= '9')) {
                        a[i++] = ch;
                } else {
                        if (a[i - 1] != '\0') {
                                s[cnt++] = p + 1;
                                a[i] = '\0';
                                p = &a[i];
                                i++;
                        }
                }
        }
        if (a[i - 1] != '\0') {
                s[cnt++] = p + 1;
                a[i] = '\0';
                p = NULL;
        }

        qsort(s, cnt, sizeof(s[0]), cmp);

        char *result = NULL;
        int j, maxsum = -1, sum;
        for (j = cnt - 1, sum = 0; j >= 1; j--) {
                if (strcmp(s[j], s[j - 1]) == 0) {
                        sum++;
                } else {
                        if (sum + 1 >= maxsum) {
                        maxsum = sum + 1;
                        result = s[j];
                        }
                        sum = 0;
                }
        }
        if (sum + 1 >= maxsum)  {
                maxsum = sum + 1;
                result = s[j];
                sum = 0;
        }

        printf("%s %d", result, maxsum);
        return 0;
}