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(char* s, char* t)
{
    int len = strlen(s);
    int i,x,y;
    char hashs[128] = {0};
    char hasht[128] = {0};

    for(i = 0; i < len; i++)
    {
        x = s[i];
        if(0 == hashs[x])
        {
            hashs[x] = t[i];
        }
        else if(hashs[x] != t[i])
        {
            return false;
        }

        /* 数组ｔ也需要同样判断，反例如："ab", "aa"　*/
        y = t[i];
        if(0 == hashs[x])
        {
            hasht[y] = t[i];
        }
        else if(hasht[y] != t[i])
        {
            return false;
        }
    }

    return true;
}