Leetcode 205. Isomorphic Strings

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

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

Reference

1. https://leetcode.com/problems/isomorphic-strings/description/