数据结构与算法串教案解析.ppt

实战练习 POJ 2503 Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them. words 100000 实战练习 Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output Cat eh loops #includeiostream #includemap //关联容器 推荐看书:C++ primer using namespace std; mapstring,stringtk; int main() { string a,b,c; unsigned i,k,t=0; while(getline(cin,c),c.find( )!=-1) { //find返回字符在串里的下标位置 k=c.find( ); a.clear(); b.clear(); for(i=0;ik;i++) a.push_back(c[i]); //在字符串之后插入一个字符 for(i=0;i+c.find( )+1c.size();i++) b.push_back(c[i+c.find( )+1]); tk.insert(make_pair(b,a)); } while(cina) if(tk[a].size()!=0) couttk[a]endl; else coutehendl; } i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 1 k=0 2 3 4 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L J 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L J H 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L J H F 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L J H F D 模拟过程 i=0 L K J I H G F E D C B A s B stk A 1 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 1 k=0 2 3 4 5 L J H F D B 模拟过程 char *RearrangeString(char *s) { char stk[M/2]; //stk是模拟的字符栈 int i, j, k; i=j=k=0; while(s[i]) //改造字符串 { if(i%2==1)