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 "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.
class Solution {
public:
bool isIsomorphic(string s, string t) {
int n = s.size();
int hashs[256] = {0};
int hasht[256] = {0};
for(int i=0;i<n;i++){
if(hashs[s[i]]==0&&hasht[t[i]]==0){
hashs[s[i]] = i+1;
hasht[t[i]] = i+1;
}
else if(hashs[s[i]]!=hasht[t[i]]) return false;
}
return true;
}
};