这篇博客详细介绍了如何解决东北欧1998年的编程竞赛题目POJ 1035，包括完整的代码实现和关键部分的注释，帮助读者理解算法思路。
Spell checker
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 19319 Accepted: 7060
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 si
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 19319 Accepted: 7060
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 si
最低0.47元/天 解锁文章
2596
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
