【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

题目大意：

我们可以理解为判断两个字符串在主要风格上是否相符。

解题思路：

ASCII有128个，我们开辟数组记录每一个字符出现的上一个位置，同时更新s和t的情况，比较上一个字符位置是否相同就可以得出结果。

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