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 "paper",244)">"title",sans-serif; font-size:14px; line-height:30px">
Note: 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;
}
};
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |