POJ 1035

直接C++自带的string库的函数，用replace函数做删除和替换，substr用于辅助插入。每生成新的串就拿到原字典中检查是否存在，用map实现，因为后面输出顺序要按照原字典出现顺序。另外新生成的合法的串不能重复，所以我开始用vector没过，改成了set，自动去掉了重复的合法串。

 

AC的很辛苦

 

#include <iostream>#include <map>#include <string>#include <vector>#include <algorithm>#include <set>#define PB push_back#define F(i,a,b) for (int i=a;i<=b;i++)using namespace std;map<string, int> dic;set<string> rep;class newstring{public:string str;newstring( string s){ str= s; }bool operator <(const newstring& b) const{return (dic[str]<dic[b.str] );}friend ostream& operator << (ostream& os, newstring b){os << b.str;return os;}};vector<newstring> rep2; // replacement wordsint main(){int len=0;string newstr,tstr;//freopen ("in.txt", "r", stdin);//freopen ("out.txt", "w", stdout);string str;while (cin >> str && str!="#"){len++;dic.insert( make_pair(str, len) );}while (cin >> str && str!="#"){rep.clear();rep2.clear();//correctif ( dic.find(str)!=dic.end() ){cout << str << " is correct/n";continue;}//deletecout << str << ": ";len=str.length()-1;F(i,0,len){newstr=str;newstr.replace(i,1,"");if ( dic.find(newstr)!=dic.end() )rep.insert( newstr );}//replaceF(i,0,len){F(j,97,97+25){newstr=str;tstr=(char)j;newstr.replace(i,1,tstr);if ( dic.find(newstr)!=dic.end() )rep.insert( newstr );}}//insertF(i,0,len+1){F(j,97,97+25){newstr=str.substr(0,i)+(char)j+str.substr(i) ;if ( dic.find(newstr)!=dic.end() )rep.insert( newstr );}}set<string>::iterator it2=rep.begin();while (it2!=rep.end() )rep2.PB( newstring(*it2++) );sort( rep2.begin(), rep2.end() );vector<newstring>::iterator it=rep2.begin();while (it!=rep2.end() )cout << *it++ << " ";cout << endl;}return 0;}