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

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) {
        int len = s.length();
        int lent = t.length();
        if(len != lent)
            return false;
        map<char, char> stot;
        map<char, char> ttos;
        for(int i = 0; i < len; i++) {
            if(stot.find(s[i]) != stot.end() && stot[s[i]] != t[i] 
            || ttos.find(t[i]) != ttos.end() && ttos[t[i]] != s[i])
                return false;
            stot[s[i]] = t[i];
            ttos[t[i]] = s[i];
        }
        return true;
    }
};

class Solution {

public:

bool isIsomorphic(string s, string t) {

int len = s.length();

int lent = t.length();

if(len != lent)

return false;

map<char, char> stot;

map<char, char> ttos;

for(int i = 0; i < len; i++) {

if(stot.find(s[i]) != stot.end() && stot[s[i]] != t[i]

|| ttos.find(t[i]) != ttos.end() && ttos[t[i]] != s[i])

return false;

stot[s[i]] = t[i];

ttos[t[i]] = s[i];

}

return true;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版