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,244)">bar,return false.
paper,244)">title,sans-serif; font-size:14px; line-height:30px">
Note:
You may assume both s and t have the same length.
class Solution {
public:
bool isIsomorphic(string s,string t) {
int len1=s.length();
map<char,char> m;
map<char,char> m2;
for(int i=0;i<len1;i++){
if(m.find(s[i])==m.end()&&m2.find(t[i])==m2.end()){
m[s[i]]=t[i];
m2[t[i]]=s[i];
}else if(m[s[i]]!=t[i]||m2[t[i]]!=s[i]){
return false;
}
}
return true;
}
};
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 dio@foxmail.com 举报，一经查实，本站将立刻删除。
