Leetcode28: 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.

意思是把左边的字符串转换成右边的字符串。转换规则是左边相同的字符必须转换为同样的字符。比如："egg" -> "add"， 由于左边的第一个'g'转换成了'd'，因此第二个'g'也要转换成'd'。"paper" -> "title"， 左边的'p'必须都转为右边的't'。同时左边不同的字符不能转换为右边相同的字符。比如：“abc" -> "dbd"就是错误的。

维护两个哈希表。记录s[i]到t[i]的映射，与t[i]到s[i]的映射。当发现与已有的映射不同时，说明无法同构，直接return false。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        int table[256] = { 0 };
        int table2[256] = { 0 };
        string temp = "";
        for (int i = 0; i < s.size(); i++){
            if (table[s[i]] == 0){
                table[s[i]] = t[i];
            }
            if (table2[t[i]] == 0){
                table2[t[i]] = s[i];
            }
            else if (s[i] != table2[t[i]])
                return false;
            temp.push_back(table[s[i]]);
        }
        if (temp == t)
            return true;
        else
            return false;
    }
};

http://www.2cto.com/kf/201505/396905.html