首页 > 代码库 > poj 1035 Spell checker（暴力判断）

poj 1035 Spell checker（暴力判断）

2024-07-21 07:37:51   219人阅读

题目链接：http://poj.org/problem?id=1035



Description

You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms. 
If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by one of the following operations: 
?deleting of one letter from the word; 
?replacing of one letter in the word with an arbitrary letter; 
?inserting of one arbitrary letter into the word. 
Your task is to write the program that will find all possible replacements from the dictionary for every given word. 

Input

The first part of the input file contains all words from the dictionary. Each word occupies its own line. This part is finished by the single character ‘#‘ on a separate line. All words are different. There will be at most 10000 words in the dictionary. 
The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by the single character ‘#‘ on a separate line. There will be at most 50 words that are to be checked. 
All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and each one contains 15 characters at most. 

Output

Write to the output file exactly one line for every checked word in the order of their appearance in the second part of the input file. If the word is correct (i.e. it exists in the dictionary) write the message: " is correct". If the word is not correct then write this word first, then write the character ‘:‘ (colon), and after a single space write all its possible replacements, separated by spaces. The replacements should be written in the order of their appearance in the dictionary (in the first part of the input file). If there are no replacements for this word then the line feed should immediately follow the colon.

Sample Input

i
is
has
have
be
my
more
contest
me
too
if
award
#
me
aware
m
contest
hav
oo
or
i
fi
mre
#

Sample Output

me is correct
aware: award
m: i my me
contest is correct
hav: has have
oo: too
or:
i is correct
fi: i
mre: more me

Source

Northeastern Europe 1998


题意：

输入一些单词作为字典，再输入一些单词查找：

1、  若某个单词能在字典中找到，则输出correct。

2、  若某个单词能通过 变换 或 删除 或 添加一个字符后，在字典中找得到，则输出这些单词，输出顺序根据  输入的字典的字典序。

3、  若某个单词无论操作与否都无法在字典中找得到，则输出空。


代码如下：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef struct letter
{
    int len;
    char s[17];
} let;
let str[10017];

void Repl(char *s, char *ss)
{
    int len = strlen(s);
    int flag = 0;
    int i = 0, j = 0;
    while(i < len)
    {
        if(flag >= 2)
            break;
        if(s[i] == ss[j])
        {
            i++,j++;
        }
        else
        {
            i++,j++;
            flag++;
        }
    }
    if(flag < 2)
        printf(" %s",s);
}
void Inse(char *s, char *ss)
{
    int len = strlen(ss);
    int flag = 0;
    int i = 0, j = 0;
    while(j < len)
    {
        if(flag >= 2)
            break;
        if(s[i] == ss[j])
        {
            i++,j++;
        }
        else
        {
            j++;
            flag++;
        }
    }
    if(flag < 2)
        printf(" %s",s);
}
void Dele(char *s, char *ss)
{
    int len = strlen(s);
    int flag = 0;
    int i = 0, j = 0;
    while(i < len)
    {
        if(flag >= 2)
            break;
        if(s[i] == ss[j])
        {
            i++,j++;
        }
        else
        {
            i++;
            flag++;
        }
    }
    if(flag < 2)
        printf(" %s",s);
}
int main()
{
    char ss[17];
    int k = 0;
    while(~scanf("%s",str[k].s))
    {
        str[k].len = strlen(str[k].s);
        if(str[k].s[0]=='#')
            break;
        k++;
    }
    while(~scanf("%s",ss))
    {
        if(ss[0] == '#')
            break;
        int len = strlen(ss);
        int flag = 0;
        for(int i = 0; i < k; i++)
        {
            if(!strcmp(ss,str[i].s))
            {
                printf("%s is correct\n",ss);
                flag = 1;
                break;
            }
        }
        if(flag)
            continue;
        printf("%s:",ss);
        for(int i = 0; i < k; i++)
        {
            if(len == str[i].len)
                Repl(str[i].s,ss);
            else if(len == str[i].len+1)
                Inse(str[i].s,ss);
            else if(len == str[i].len-1)
                Dele(str[i].s,ss);
        }
        printf("\n");
    }
    return 0;
}





poj 1035 Spell checker（暴力判断）


联系
我们