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.
题目思路:
哈希表,给予两个字符串相同位置的字符相同的映射,如果对应位置元素映射不同,说明不是Isomorphic String
题目代码:
class Solution {
public:
bool isIsomorphic(string s, string t) {
int table1[256] = {1};
int table2[256] = {1};
for(int i = 0; i < s.length(); i++){
if(table1[s[i]] == table2[t[i]]){
table1[s[i]] = i+1;
table2[t[i]] = i+1;
}else{
return false;
}
}
return true;
}
};