205. Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.
Two strings are isomorphic if the characters in s can be replaced to get t.
All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.
For example,
Given "egg"
, "add"
, return true.
Given "foo"
, "bar"
, return false.
Given "paper"
, "title"
, return true.
Note:
You may assume both s and t have the same length.
这个题和之前做过的一个题比较类似,求一对一关系,用两个map实现即可。
class Solution {
public:
bool isIsomorphic(string s, string t) {
map<char, int> ms;
map<char, int >mt;
for (int i = 0; i < s.size(); i++) {
if (ms[s[i]] == 0) ms[s[i]] = i;
if (mt[t[i]] == 0) mt[t[i]] = i;
}
for (int i = 0; i < s.size(); i++) {
if (ms[s[i]] != mt[t[i]]) return 0;
}
return 1;
}
};