-
Notifications
You must be signed in to change notification settings - Fork 0
/
isomorphicStrings.cpp
57 lines (55 loc) · 928 Bytes
/
isomorphicStrings.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
57
#include <map>
#include <set>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
using namespace std;
class Solution {
unordered_map<char, int> chs, cht;
unordered_set<int> indexs, indext;
public:
bool isIsomorphic(string s, string t) {
int i = 0;
for (auto c : s)
{
if (chs.find(c) != chs.cend())
{
indexs.insert(chs[c]);
indexs.insert(i);
}
else
chs.insert({ c, i });
i++;
}
i = 0;
for (auto c : t)
{
if (cht.find(c) != cht.cend())
{
indext.insert(cht[c]);
indext.insert(i);
}
else
cht.insert({ c, i });
i++;
}
auto setPtr = indexs.cbegin();
if (indext.size() != indexs.size())
{
return false;
}
while (setPtr != indexs.cend())
{
cout << *setPtr << endl;
if (indext.find(*setPtr) == indext.end())
return false;
setPtr++;
}
return true;
}
};
int main()
{
Solution A;
A.isIsomorphic("aba", "baa");
}