forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path242.cpp
More file actions
107 lines (99 loc) · 2.29 KB
/
242.cpp
File metadata and controls
107 lines (99 loc) · 2.29 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
class Solution {
public:
string selectionSort(string s){
int index;
for(int i=0;i<s.length();i++){
index=i;
for(int j=i;j<s.length();j++){
if(s[j]<s[index]) index=j;
}
auto temp=s[i];
s[i]=s[index];
s[index]=temp;
}
return s;
}
string insertionSort(string s){
int j;
for(int i=1;i<s.length();i++){
char key=s[i];
j=i-1;
while(j>=0 && key<s[j]){
s[j+1]=s[j];
j--;
}
s[j+1]=key;
}
return s;
}
string bubbleSort(string s){
for(int i=0;i<s.length();i++){
for(int j=0;j<s.length()-i-1;j++){
if(s[j]>s[j+1]){
auto temp=s[j+1];
s[j+1]=s[j];
s[j]=temp;
}
}
}
return s;
}
void merge(string &s,int l,int m,int r){
int n1=m-l+1,n2=r-m,i,j,k=l;
string s1,s2;
for(i=0;i<n1;i++) s1+=s[l+i];
for(j=0;j<n2;j++) s2+=s[m+1+j];
i=0,j=0;
while(i<n1 && j<n2){
if(s1[i]<s2[j]){
s[k]=s1[i];
i++;
}
else{
s[k]=s2[j];
j++;
}
k++;
}
while(i<n1){
s[k]=s1[i];
i++;
k++;
}
while(j<n2){
s[k]=s2[j];
j++;
k++;
}
}
void mergeSort(string &s,int l,int r){
if(l<r){
int mid=(l+r)/2;
mergeSort(s,l,mid);
mergeSort(s,mid+1,r);
merge(s,l,mid,r);
}
}
bool isAnagram(string s, string t) {
mergeSort(s,0,s.length()-1);
mergeSort(t,0,t.length()-1);
return s==t;
}
};
//method 2: without sorting
class Solution {
public:
bool isAnagram(string s, string t) {
int len = s.length();
if (len != t.length()) return false;
vector<int> Hash(26, 0);
for(int i=0;i<len;i++){
Hash[s[i]-'a']++;
Hash[t[i]-'a']--;
}
for(int i=0;i<26;i++){
if(Hash[i]) return false;
}
return true;
}
};