poj1035 Spell checker
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
brutal force
1. 生成字典， 并按长度排序。
2. 对于给定单词， 取得区间 [单词长度 - 1, 单词长度 + 1], 并匹配。
3. 如果存在完全匹配的单词， 打印输出， 否则把可能的单词放到集合中。
// POJ1035.cpp : Defines the entry point for the console application.
//
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
using namespace std;
struct Word
{
Word(int p, int l, const string& s):pos(p),len(l),word(s){};
int pos;
int len;
string word;
};
class CheckRange
{
int m_len;
public:
CheckRange(int len):m_len(len){};
bool operator()(const Word& w)
{
return m_len <= w.len;
}
};
class LenLess{
public:
bool operator()(const Word& w1, const Word& w2)
{
return w1.len < w2.len;
};
};
class PosLess{
public:
bool operator()(const Word& w1, const Word& w2)
{
return w1.pos < w2.pos;
};
};
int checkString(const string& str1, const string& str2)
{
int cnt = 0;
if (str1.size() < str2.size())
{
int i = 0, j = 0;
while(i < str1.size() && j < str2.size())
{
if (str1[i] != str2[j])++cnt,++j;
else ++i,++j;
}
cnt += str1.size() - i + str2.size() - j;
}
else if (str1.size() == str2.size())
{
for (int i = 0; i < str1.size(); ++i)
if (str1[i] != str2[i])++cnt;
}
else
cnt = checkString(str2, str1);
return cnt;
};
int main(int argc, char* argv[])
{
vector<Word> Dic;
string w;
int i = 0;
while (cin >> w && w != "#")
{
Dic.push_back(Word(i,w.size(),w));
++i;
}
std::sort(Dic.begin(),Dic.end(),LenLess());
vector<Word> v;
vector<Word>::iterator iter, beg, end;
vector<string> op;
while (cin >> w && w != "#")
{
v.clear();
beg = std::find_if(Dic.begin(), Dic.end(), CheckRange(w.size() - 1));
end = std::find_if(Dic.begin(), Dic.end(), CheckRange(w.size() + 2));
bool same = false;
for (iter = beg; iter != end; ++iter)
{
int r = checkString(w, iter->word);
if (r == 0)
{
v.clear();
v.push_back(*iter);
same = true;
break;
}
else if (r == 1)
v.push_back(*iter);
};
if (same == true) op.push_back(w + " is correct\n");
else
{
std::sort(v.begin(),v.end(),PosLess());
string tp = w + ":";
for (int i = 0; i < v.size(); ++i)
tp += " " + v[i].word;
tp +="\n";
op.push_back(tp);
}
}
for (int i = 0; i < op.size(); ++i)
cout << op[i];
return 0;
} #include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<deque>
#include<list>
using namespace std;
char map[10010][16];
char str[30];
int isok(int n)
{
int i,j,k;
int l1=strlen(str),l2=strlen(map[n]);
switch(l1-l2)
{
case 1:
k=0;
for(i=j=0; i<l1;)
if(str[i]!=map[n][j])
k++,i++;
else
i++,j++;
if(k==1)
return 1;
break;
case 0:
k=0;
for(i=j=0; i<l1; i++,j++)
if(str[i]!=map[n][j])
k++;
if(k==1)
return 1;
break;
case -1:
k=0;
for(i=j=0; j<l2;)
if(str[i]!=map[n][j])
k++,j++;
else
i++,j++;
if(k==1)
return 1;
break;
}
return 0;
}
int main()
{
int i=0,N=0;
while(scanf("%s",map[N])&&strcmp(map[N],"#")!=0) N++;
while(scanf("%s",str)&&strcmp(str,"#")!=0)
{
for(i=0; i<N; i++)
if(strcmp(str,map[i])==0)
{
printf("%s is correct\n",str);
break;
}
if(i==N)
{
printf("%s:",str);
for(i=0; i<N; i++)
if(isok(i))
printf(" %s",map[i]);
printf("\n");
}
}
return 0;
} 
