LeetCode:Isomorphic Strings(同构字符串)
1、题目:
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.
2、代码:
class Solution {
public:
bool isIsomorphic(string s, string t) {
char hash[128]{};//根据ASCII确定数组大小
int len=s.length();
for(int i=0;i<len;++i)
{
if(!hash[s[i]])
{
for(int j=0;j<128;++j)//确定t[i]没有出现过
{
if(hash[j]==t[i])
{
return false;
}
}
hash[s[i]]=t[i];
}
else if(hash[s[i]]!=t[i])
{
return false;
}
}
return true;
}
};
3、总结:
ASCII码表:128个。