Leetcode 205. Isomorphic Strings (Easy) (cpp)

Leetcode 205. Isomorphic Strings (Easy) (cpp)

Tag: Hash Table

Difficulty: Easy

/*

205. Isomorphic Strings (Easy)

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.

*/
class Solution {
public:
    bool isIsomorphic(string s, string t) {
        if (s.length() == 0) {
            return true;
        }
        unordered_map<char, char> mapping;
        set<char> Set;  
        for (int i = 0; i < s.length(); i++) {
            char s1 = s[i], t1 = t[i];
            if (mapping.find(s1) != mapping.end()) {
                if (mapping[s1] != t1) return false;
            } else {
                if (Set.count(t1) == 1) {
                    return false;
                } else {
                    mapping[s1] = t1;
                    Set.insert(t1);
                }
            }
        }
        return true;
    }
};
class Solution {
public:
    bool isIsomorphic(string s, string t) {
        int cs[128] = {0}, ct[128] = {0};
        for(int i=0; i<s.size(); i++) {
            if(cs[s[i]] != ct[t[i]]) {
                return false;
            } else if(!cs[s[i]]) {
                cs[s[i]] = i+1;
                ct[t[i]] = i+1;
            }
        }
        return true;
    }
};