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.

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

Given "foo", "bar", return false.

Given "paper", "title", return true.

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