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.
1.我的答案
class Solution {
public:
bool isIsomorphic(string s, string t) {
vector<int> v1(256,0);
vector<int> v2(256,0);
for(int i = 0; i < s.size(); i++){
if(v1[s[i]] != v2[t[i]])
return false;
v1[s[i]] = i+1;
v2[t[i]] = i+1;
}
return true;
}
};