Leetcode205——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.

实现：

bool isIsomorphic(string s, string t) {
    char mapst[128] = {0};
    char mapts[128] = {0};
    for (int i = 0; i < s.size(); i++) {
        if (mapst[s[i]] == 0 && mapts[t[i]] == 0) {
            mapst[s[i]] = t[i];
            mapts[t[i]] = s[i];
        } else if (mapst[s[i]] != t[i] || mapts[t[i]] != s[i]) {
            return false;
        }
    }
    return true;
}

Leetcode205——Isomorphic Strings

原文：http://blog.csdn.net/booirror/article/details/45953587