[Leetcode] Isomorphic Strings

Isomorphic Strings

Given strings s and t, determine if they are isomorphic.

The strings is isomorphic if the characters in s can is replaced to get t.

All occurrences of a character must is replaced with another character while preserving the order of characters. No, characters may map to the same character and a character may map to itself.

For example,
Given "egg" , "add" return True.

given " foo ",  " bar ", return false.

Given "paper" , "title" return True.

Note:
Assume both s and T have the same length.

Problem Solving Ideas:

This question is to determine whether the two words are isomorphic. The isomorphism here means that for example egg and add, if there is a mapping, e->a,g->d, the word egg and add isomorphism. Note that you cannot map multiple characters to the same character, such as AA and AB. So there are two hash tables to keep track of. Because it is a character, no more than 256, you can use an array to record this mapping.

Class Solution {public:    bool Isisomorphic (string s, String t) {        int len1=s.length ();        int len2=t.length ();        if (len1!=len2) {            return false;        }        Char charmap[256];        Char charmap1[256];        memset (charmap, 0, sizeof (char) *256);        memset (charMap1, 0, sizeof (char) *256);        for (int i=0; i<len1; i++) {            if (charmap[s[i]]==0) {                charmap[s[i]] = T[i];            } else if (Charmap[s[i]]!=t[i]) {                return false;            }            if (charmap1[t[i]]==0) {                charmap1[t[i]] = s[i];            } else if (Charmap1[t[i]]!=s[i]) {                return false;            }        }        return true;    }};

[Leetcode] Isomorphic Strings