poj 1035 Spell checker

Spell checker

Time Limit: 2000 MS Memory Limit: 65536 KB

64-bit integer IO format: %I64d , %I64u   Java class name: Main

[Submit] [Status] [Discuss]

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

题意：查找字典 

直接模拟替换加减的过程。

比较两个串的长度。要相差为1 的时候才能进行模拟。

模拟的过程就是进行一个个的匹配。

发现失配的次数小于等于 1就可以输出。
分情况：1：相等
2：l1==l2
l1-l2==1 加一
l1-l2==-1 删一

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

using namespace std;
char map[][];
char str[];

int IsOk(int n)
{
    int l1=strlen(str);
    int l2=strlen(map[n]);
    int k,i,j;
    switch(l1-l2)
    {
    case :
    k=;
        for(i=j=; i<l1;)
        {
            if(str[i]!=map[n][j])
                k++,i++;
            else
                i++,j++;
        }
        if(k==)
            return ;
        break;
    case :
    k=;
        for(i=j=; i<l1; i++,j++)
        {
            if(str[i]!=map[n][j])
                k++;
        }
        if(k==)
            return ;
        break;
    case -:
    k=;
        for(i=j=; j<l2;)
        {
            if(str[i]!=map[n][j])
                k++,j++;
            else
                i++,j++;
        }
        if(k==)
            return ;
        break;
    }
    return ;
}

int main()
{
    int N=;
    int i=;
    while(scanf("%s",map[N])&&strcmp(map[N],"#")!=) N++;
    while(scanf("%s",str)&&strcmp(str,"#")!=)
    {
        for(i=; i<N; i++)
        {
            if(strcmp(str,map[i])==)
            {
                printf("%s is correct\n");
                break;
            }
        }
        if(i==N)
        {
            printf("%s:",str);
            for(int i=; i<N; i++)
                if(IsOk(i))
                    printf(" %s",map[i]);
                    printf("\n");
        }
    }
    return ;
}