205. 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.

Example 1:

Input: s = "egg", t = "add"
Output: true

Example 2:

Input: s = "foo", t = "bar"
Output: false

Example 3:

Input: s = "paper", t = "title"
Output: true

Note:
You may assume both s and t have the same length.

这个题目说白了，就是s中的每个字母，都会映射到t中，只要检索过程中，保持映射不变，即为true。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        unordered_map<char, char> helper;
        for(int i = 0; i < s.size(); i++)
        {
            for(auto item : helper)
            {
                if(item.second == t[i] and item.first != s[i])
                    return false;
            }
            if(helper.count(s[i]) > 0)
            {
                if(helper[s[i]] != t[i])
                    return false;
            }
            else
                helper[s[i]] = t[i];
        }
        return true;
    }

};

但是另一种做法觉得简洁，只是不容易想到。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        unordered_map<char, int> shelper, thelper;
        for(int i = 0; i < s.size(); i++)
        {
            if(shelper[s[i]] != thelper[t[i]]) return false;
            shelper[s[i]] = i + 1;
            thelper[t[i]] = i + 1;
        }
        return true;
    }

};