最新消息:点击查看大S的省钱秘笈

POJ 1035 Spell checker C++版

POJ题解 Slyar 79浏览 0评论

文章作者:姜南(Slyar) 文章来源:Slyar Home (www.slyar.com) 转载请注明,谢谢合作。

字符串处理,继续用STL。

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

Slyar:录入字典,然后根据规则(替换一个字符、添加一个字符、删除一个字符)查找单词,注意如果有多个单词符合条件,要按给出的字典顺序输出。

既然又是字符串的题,那继续使用STL...我为了条理写了3个函数分别处理,其实不用这么麻烦的,写一个比较函数就够了,而且只统计不一样的字符个数就OK...

郁闷的是我写完用G++交就TLE,换C++交就AC...G++对STL这么不友好么?不管了,反正换成字符数组写肯定是可以A的...水题,不写了。

转载请注明:Slyar Home » POJ 1035 Spell checker C++版

发表我的评论
取消评论

表情

Hi,您需要填写昵称和邮箱!

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

网友最新评论 (1)

  1. 我也遇到了你这个问题 那叫一个悲剧啊 但是这道题好像可以用trie树的
    呢喃的歌声6年前 (2011-04-23)回复