1. 1st Source ¶
#include <map>
#include <string>
#include <iostream>
#include <fstream>
using namespace std;
class Anagram
{
private:
typedef map< string, map<char, int> >::iterator MSMCII;
typedef map< char, int > MCI;
map< string, map<char, int> > _anagramTable;
public:
void CalWhatAnagram(const string& str)
{
MCI howManyEachAlphabet;
for(int i = 0 ; i < str.size() ; ++i)
howManyEachAlphabet[ str[i] ] += 1;
_anagramTable[str] = howManyEachAlphabet;
}
void Show()
{
while( !_anagramTable.empty() )
{
MCI value = _anagramTable.begin()->second;
for(MSMCII i = _anagramTable.begin() ; i != _anagramTable.end() ; )
{
if(i->second == value)
{
cout << i->first << " ";
_anagramTable.erase(i++);
}
else
{
++i;
}
}
cout << endl;
}
}
};
int main()
{
Anagram anagram;
ifstream fin("input.dat");
string t;
while(!fin.eof())
{
getline(fin, t);
anagram.CalWhatAnagram(t);
}
anagram.Show();
fin.close();
return 0;
}
2. 1st ¶
- , 값 그 , 값 <, 그 개> Pair Pair .(--; 군)
- 기, 갯 n개, 균 길 m , Pair Θ(mn) 간 걸. 그 map Θ(n) 간 걸.
- 기, 갯 n개, 균 길 m , Pair Θ(mn) 간 걸. 그 map Θ(n) 간 걸.
- map 객 , 까 anagram .( 기 .)
- . Θ(n*n) 간 걸 .
- . Θ(n*n) 간 걸 .
- 갯 길... . 고 Θ(n*n) 간 걸고 .
4. 2nd Source ¶
~cpp
#include <map>
#include <string>
#include <vector>
#include <iostream>
#include <fstream>
using namespace std;
class Anagram
{
private:
typedef map<char, int> MCI;
typedef vector<string> LS;
typedef map< MCI, LS > MALS;
typedef MALS::iterator MALSI;
typedef LS::iterator LSI;
MALS _anagramTable;
MCI CalculateWhatAnagram(const string& str)
{
MCI howManyEachAlphabet;
for(int i = 0 ; i < str.size() ; ++i)
howManyEachAlphabet[ str[i] ] += 1;
return howManyEachAlphabet;
}
public:
void BoundAnagram(char* fileName)
{
ifstream fin(fileName);
string str;
while(!fin.eof())
{
getline(fin, str);
_anagramTable[ CalculateWhatAnagram(str) ].push_back(str);
}
}
void ShowAnagram()
{
for(MALSI i = _anagramTable.begin() ; i != _anagramTable.end() ; ++i)
{
for(LSI j = (i->second).begin() ; j != (i->second).end(); ++j)
{
cout << *j << " ";
}
cout << endl;
}
}
};
int main()
{
Anagram ana;
ana.BoundAnagram("input.dat");
ana.ShowAnagram();
return 0;
}
5. 2nd ¶
- key : map , value : 그 string list. .
- 1st 간 까.. 90 까거 .
- 간 계, 개 n, 균 길 m , : Θ(mn), : Θ(n) 간 그 m n ~~~~~ . Θ(n) ?--; 궤 .
6. 2nd 개 ¶
- .
- 1(2개) . 까. 게 10 ..--; 10 걸 걸까.
- 근 까 10(2개) . 길--;
- 게 각 걸. "~~~ inputed!"고 게 10 걸, 걸 1 걸.
- list vector 꾸고 6.2 걸.










