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.
class Solution {
public:
//map 两遍映射
bool isIsomorphic(string s, string t) {
map<char,char> map;
int len1=s.size(),len2=t.size();
if(len1!=len2)
return false;
for(int i=0;i<len1;i++){
if(map.find(s[i])!=map.end() && map[s[i]]!=t[i])
return false;
else
map[s[i]]=t[i];
}
map.clear();
for(int i=0;i<len1;i++){
if(map.find(t[i])!=map.end() && map[t[i]]!=s[i])
return false;
else
map[t[i]]=s[i];
}
return true;
}
};