UVa156 复杂数据结构标准化思路

采用数据结构与大概流程

代码实现

#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

string standard(const string &s)
{
string input;
input = s;
for (auto it = input.begin(); it != input.end(); it++)
{
*it = tolower(*it);
}
sort(input.begin(), input.end());
return input;
}
int main()
{
string input;
vector<string> saved;
map<string, int> result;
while (true)
{
cin >> input;
if (input == "#")
break;
saved.push_back(input);
input = standard(input);
if (result.count(input) == 0)
result[input] = 0;
result[input]++;
}
set<string> ans;
for (auto it = saved.cbegin(); it != saved.cend(); it++)
{
if (result[standard(*it)] == 1)
{
ans.insert(*it);
}
}
for (auto it = ans.cbegin(); it != ans.cend(); it++)
{
cout << *it << endl;
}
//system("pause");
return 0;
}