UVa 156 - 反片语Ananagrams

Ananagrams

Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute, no matter how you rearrange their letters, you cannot form another word. Such words are called ananagrams, an example is QUIZ.

 

Obviously such definitions depend on the domain within which we are working; you might think that ATHENE is an ananagram, whereas any chemist would quickly produce ETHANE. One possible domain would be the entire English language, but this could lead to some problems. One could restrict the domain to, say, Music, in which case SCALE becomes a relative ananagram (LACES is not in the same domain) but NOTE is not since it can produce TONE.

 

Write a program that will read in the dictionary of a restricted domain and determine the relative ananagrams. Note that single letter words are, ipso facto, relative ananagrams since they cannot be ``rearranged'' at all. The dictionary will contain no more than 1000 words.

 

Input

Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken across lines. Spaces may appear freely around words, and at least one space separates multiple words on the same line. Note that words that contain the same letters but of differing case are considered to be anagrams of each other, thus tIeD and EdiT are anagrams. The file will be terminated by a line consisting of a single #.

 

Output

Output will consist of a series of lines. Each line will consist of a single word that is a relative ananagram in the input dictionary. Words must be output in lexicographic (case-sensitive) order. There will always be at least one relative ananagram.

 

Sample input

 

ladder came tape soon leader acme RIDE lone Dreis peat
 ScAlE orb  eye  Rides dealer  NotE derail LaCeS  drIed
noel dire Disk mace Rob dries
#

 

Sample output

 

Disk
NotE
derail
drIed
eye
ladder
soon

分析


这道题的解法很多，最简化的方式就是使用map容器。想到使用“标准化”。
整体思路：
1.写一个标准化函数（实现大写字母转换为小写（tolower（）函数），单词排序。注意使用const是为了不改变s的初值）
2.两个vector容器（words，ans），一个map容器（cnt）
words存储所有的单词
map存储标准化后对应单词以及出现次数的值，相当于一个表格。
words经过查表map，把对应的符合值给ans
3.输出

代码：

 1 #include<iostream>
 2 #include<string>
 3 #include<vector>
 4 #include<algorithm>
 5 #include<cctype>
 6 #include<map>
 7 using namespace std;
 8 map<string,int>cnt;
 9 vector<string>words;
10 //将单词s标准化 
11 string repr(const string& s)//这个设计很巧妙 ，不改变原值 
12 {
13     string ans=s;
14     for(int i=0;i<ans.size();i++)
15     ans[i]=tolower(ans[i]);//大写字母转化为小写 
16     sort(ans.begin(),ans.end());
17     return ans;
18 }
19 int main()
20 {
21     int n=0;
22     string s;
23     while(cin>>s)
24     {
25         if(s[0]=='#')break;
26         words.push_back(s);
27         string r=repr(s);
28         //cout<<r<<endl;
29     if(!cnt.count(r))cnt[r]=0;//count（）如果键值存在返回1，否则返回0；初始化键值对应的值 
30     cnt[r]++;
31     }
32     vector<string>ans;
33     for(int i=0;i<words.size();i++)
34     if(cnt[repr(words[i])]==1)ans.push_back(words[i]);//查map表，将符合条件的单词放进ans容器 
35     sort(ans.begin(),ans.end());
36     for(int i=0;i<ans.size();i++)
37     cout<<ans[i]<<endl;
38     return 0;    
39 }

 

转载于:https://www.cnblogs.com/masking-timeflows/p/6628027.html