【leetcode】【easy】205. Isomorphic Strings

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.

题目链接：https://leetcode.com/problems/isomorphic-strings/

解法：map

这题和字符串pattern那道类似，只不过pattern-string映射变为了pattern-char映射。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        if(s.length()!=t.length()) return false;
        unordered_map<char,char> record;
        unordered_set<char> values;
        for (int i=0;i<s.length();++i){
            if(record.find(s[i])==record.end()) {
                if(values.find(t[i])!=values.end()) return false;
                values.insert(t[i]);
                record[s[i]] = t[i];
            }else if(record[s[i]]!=t[i]) return false;
        }
        return true;
    }
};