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.

Example 1:

Input: s = "egg", t = "add"
Output: true

Example 2:

Input: s = "foo", t = "bar"
Output: false

Example 3:

Input: s = "paper", t = "title"
Output: true

Note:
You may assume both s and t have the same length.

 

代码：

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

 

效率优于95%的C++解法~（当然不排除有缓存加速之类的可能性