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.size()!=t.size())return false;
        map<char,char>mp;
        for(int i=0;i<s.size();i++){
            if(mp.find(s[i])==mp.end())mp[s[i]]=t[i];
            else if(mp[s[i]]!=t[i])return false;
        }
        mp.clear();
        for(int i=0;i<t.size();i++){
            if(mp.find(t[i])==mp.end())mp[t[i]]=s[i];
            else if(mp[t[i]]!=s[i])return false;
        }
        return true;
    }
};

思路二，在后来做题目的时候想到 这个题目一次FOR循环就足矣解决问题了。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        if(s.size()!=t.size())return false;
        map<char,char>mp1;
        map<char,char>mp2;
        for(int i=0;i<s.size();i++){
            if(mp1.find(s[i])==mp1.end()&&mp2.find(t[i])==mp2.end()){
                mp1[s[i]]=t[i];
                mp2[t[i]]=s[i];
            }
            else if(mp1[s[i]]!=t[i]||mp2[t[i]]!=s[i])return false;
        }
        return true;
    }
};