leetcode205. isomorphic strings

leetcode205. Isomorphic Strings

hash思维

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.

这道题让我们求同构字符串，就是说原字符串中的每个字符可由另外一个字符替代，可以被其本身替代，相同的字符一定要被同一个字符替代，且一个字符不能被多个字符替代，即不能出现一对多的映射。根据一对一映射的特点，我们需要用两个哈希表分别来记录原字符串和目标字符串中字符出现情况，由于ASCII码只有256个字符，所以我们可以用一个256大小的数组来代替哈希表，并初始化为0，我们遍历原字符串，分别从源字符串和目标字符串取出一个字符，然后分别在两个哈希表中查找其值，若不相等，则返回false，若相等，将其值更新为i + 1，代码如下：

/* 1、两个字符串长度应相同
 * 2、用两个哈希表分别来记录原字符串和目标字符串中字符出现情况
 * 每次出现，就会记录一个不同的值
 */
bool isIsomorphic(string s, string t) {
    if (s.length() != t.length()) {
        return false;
    }

    //如果两字符串长度为1，显然是可以
    if (s.length() == 1 || s.length() == 0) {
        return true;
    }

    int sm[256] = {0};
    int tm[256] = {0};

    for (int i = 0; i < s.length(); i++) {
        if (sm[s[i]] != tm[t[i]]) {
            return false;
        }
        else {
            sm[s[i]] = i + 1;
            tm[t[i]] = i + 1;
        }

    }

    return true;
}