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

算法分析：

查找当前元素的下一个相同元素的位置

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