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.

示例：

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.length() != t.length()) return false;
        map<char,char> ms;
        map<char,char> mt;
        for(int i = 0; i < s.length(); i++)
        {
        	if(ms.count(s[i]) == 0)

				ms.insert(pair<char,char>(s[i],t[i]));

			if(mt.count(t[i]) == 0)

				mt.insert(pair<char,char>(t[i],s[i]));
        		
			if(ms[s[i]] != t[i] || mt[t[i]] != s[i]) return false;
		}
		return true;
    }
};