题意:输入一些单词,找出所有满足如下条件的单词:该单词不能通过字母重排,得到输入文本的另外一个单词。在判断是否满足条件时,字母不分大小写,但在输出时应保留输入中的大小写,按字典序进行排序。
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cctype>
#include<cstring>
using namespace std;map<string,int> cnt;
vector<string> words;
string reper( const string& s)//对单词进行处理
{string ans = s;for (int i =0 ;i < ans.length(); i++){ans[i]= tolower(ans[i]);}sort(ans.begin(), ans.end());return ans;
}
int main()
{string s;while(cin >> s){if(s[0] =='#') break;words.push_back(s);string r = reper(s);if(!cnt.count(r)) cnt[r] = 0;cnt[r]++;}vector<string> ans;//用来存储满足条件的单词for (int i = 0; i < words.size(); i++){if(cnt[reper(words[i])] == 1) ans.push_back(words[i]);}sort(ans.begin(),ans.end());for (int i = 0; i < ans.size(); i++)cout << ans[i] << endl;return 0;
}