c++ vector set map

 1 #include <iostream>
 2 #include <vector>
 3 #include <algorithm>
 4 #include <stdlib.h>
 5 #include <bits/stdc++.h>
 6 using namespace std;
 7 
 8 int main()
 9 {
10     set<string> a;
11     int n,d;
12     string word;
13     cin>>n;
14     for(int i=0;i<n;i++)
15     {
16         cin>>d>>word;
17         transform(word.begin(),word.end(),word.begin(),::tolower);
18         if(d==0)
19         {
20             a.insert(word);
21         }
22         else
23         {
24             if(a.count(word))
25             {
26                 cout<<"Yes"<<endl;
27             }
28             else
29             {
30                 cout<<"No"<<endl;
31             }
32         }
33     }
34 
35     return 0;
36 }

 1 #include <iostream>
 2 #include <vector>
 3 #include <algorithm>
 4 #include <stdlib.h>
 5 #include <bits/stdc++.h>
 6 using namespace std;
 7 
 8 int main()
 9 {
10     map<string,string> dic;
11     string beg;
12     cin>>beg;
13     string v;
14     while(1)
15     {
16         cin>>v;
17         string k;
18         if(v!="END")
19         {
20             cin>>k;
21             dic.insert(pair<string,string>(k,v));
22         }
23         else
24         {
25             break;
26         }
27     }
28 
29     cin>>beg;
30     string text;
31     getline(cin,text);
32     while(1)
33     {
34         getline(cin,text);
35         if(text!="END")
36         {
37             int p=0;
38             while(p<text.length())
39             {
40                 //每次组成一个单词，决定是否替换
41                 string word;
42                 while(65<=text[p]&&90>=text[p]||97<=text[p]&&122>=text[p])
43                 {
44                     word+=text[p];
45                     p++;
46                 }
47                 if(!(65<=text[p]&&90>=text[p]||97<=text[p]&&122>=text[p]))
48                 {
49                     p++;
50                 }
51                 if(dic.count(word))
52                 {
53                     //下标移动替换后变换的长度
54                     int b=dic[word].length()-word.length();
55                     p+=b;
56                     //替换单词
57                     text.replace(text.find(word),word.length(),dic[word]);
58                 }
59             }
60             cout<<text<<endl;
61         }
62         else
63         {
64             break;
65         }
66     }
67     return 0;
68 }