-
Notifications
You must be signed in to change notification settings - Fork 0
/
anagram.cpp
56 lines (51 loc) · 1.04 KB
/
anagram.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include<stdlib.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
//Using sorting
int check_anagram1(string s1,string s2)
{
sort(s1.begin(),s1.end());
sort(s2.begin(),s2.end());
if(s1==s2)
return 1;
else
return 0;
}
//Using map
int check_anagram2(string s, string t)
{
if(s.length()!=t.length())
return false;
map<char, int> freq;
for(int i=0;i<s.length();i++)
{
freq[s[i]]++;
}
for(int i=0;i<t.length();i++)
{
freq[t[i]]--;
}
for(int i=0;i<freq.size();i++)
{
if(freq[i]!=0)
return false;
}
return true;
}
int main()
{
int res = check_anagram1("cinema","iceman");
if(res)
cout<<"Is an anagram\n";
else
cout<<"Not an anagram\n";
int res2 = check_anagram2("cinema","iceman");
if(res2)
cout<<"Is an anagram\n";
else
cout<<"Not an anagram\n";
return 0;
}