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.

一开始想了一个用map的方法，不太行……其实用数组就可以，以ASCII码为下标，然后存储的是上一次该字母出现的位置。两个数组存储的应该是完全一样的。

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        
        int ms[128]={0}, mt[128]={0};
        for(int i=0; i<s.size(); ++i){
            if(ms[s[i]]!=mt[t[i]]) return false;
            else if(!ms[s[i]]){
                ms[s[i]]=i+1;
                mt[t[i]]=i+1;
            }
        }
        
        return true;
        
    }
};