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

【思路】

使用hash表，先从s对t进行映射一遍，如果映射的值不同，则说明不同构，返回false，再反过来从t对s映射一遍，同理。

【代码】

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