205. 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

 

  很傻比的方法。。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        if(s.empty()) return true;
        unordered_map<char, char> mp;
        for(int i = 0; i < s.size(); ++i) mp[s[i]] = '0';
        for(int i = 0; i < s.size(); ++i){
            if(mp[s[i]] == '0'){
                mp[s[i]] = t[i];
            }
            if(mp[s[i]] != t[i])
            return false;
        }
        for(int i = 0; i < s.size(); ++i) mp[t[i]] = '0';
        for(int i = 0; i < t.size(); ++i){
            if(mp[t[i]] == '0'){
                mp[t[i]] = s[i];
            }
            if(mp[t[i]] != s[i])
            return false;
        }
        return true;

   }
};

                       !  !

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        vector<int> s1(128,-1);
        vector<int> t1(128,-1);
        for(int i = 0; i < s.size(); ++i){
            if(s1[s[i]] != t1[t[i]]) return false;
            else{
                s1[s[i]] = i;
                t1[t[i]] = i;
            }
            
        }
        return true;
   }
};