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.
建立兩個表：
①從字符串s到字符串t的字符映照表，由于最大的字母為122，因此映照表的大小為123。映照表鍵值為s中的字符，value為t中對應位置的字符。
②isUsed表代表t中的該字符是不是已被作為s中某字符的value值。
#include <iostream>
using namespace std;
//Runtime:12ms
class Solution {
public:
bool isIsomorphic(string s, string t) {
int len = s.size();
unsigned char map[123] = {0};
bool isUsed[123] = {0};
for (int i = 0; i < s.size(); i++)
{
if (map[s[i]] == 0)
{
if (!isUsed[t[i]])
{
map[s[i]] = t[i];
isUsed[t[i]] = true;
}
else
{
return false;
}
}
else if (map[s[i]] != t[i])
{
return false;
}
}
return true;
}
};
int main()
{
Solution s;
cout<<s.isIsomorphic("aba", "baa")<<endl;
cout<<s.isIsomorphic("egg", "add")<<endl;
cout<<s.isIsomorphic("foo", "bar")<<endl;
cout<<s.isIsomorphic("paper", "title")<<endl;
}
上一篇 Java Notes-10
下一篇 算法薦書（程序員練功+大眾科普）
程序員人生，我編程，我富裕，記住wfuyu網，php教程，php學習，php手冊，CMS模版制作
聲明：本站大部分內容是作者原創，少部分收集于互聯網供大家一起學習，原版權很多不明，如有侵權請聯系本站，謝謝！
粵ICP備14040726號-1?? 2015-2020 程序員人生 版權所有
