# [leetcode 205] Isomorphic Strings

230人阅读 评论(0)

Question:

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 "foo", "bar", return false.

Given "paper", "title", return true.

<span style="font-size:14px;">class Solution {
public:
bool isIsomorphic(string s, string t) {
/*unordered_map<char,char> unordmap1, unordmap2;
if(s.length() != t.length())
return false;
for(int i = 0; i < s.length(); ++i){
if(unordmap1.find(s[i]) == unordmap1.end())
unordmap1[s[i]] = t[i];
else{
if(t[i] != unordmap1[s[i]])
return false;
}
if(unordmap2.find(t[i]) == unordmap2.end())
unordmap2[t[i]] = s[i];
else{
if(s[i] != unordmap2[t[i]])
return false;
}
}
return true;*/

if (check(s, t) && check(t,s))
return true;
else
return false;
}
bool check(string s, string t) {
int dict[256];
fill_n(dict, 256, 0);
for (int i=0; i<s.length(); i++)
if (dict[s[i]]==0) dict[s[i]]=t[i];
else if (dict[s[i]] != t[i])
return false;
return true;
}
};</span>

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：47297次
• 积分：1673
• 等级：
• 排名：千里之外
• 原创：126篇
• 转载：6篇
• 译文：0篇
• 评论：1条
文章分类
评论排行
最新评论