LeetCode Isomorphic Strings

最新推荐文章于 2020-06-07 10:18:25 发布

原创最新推荐文章于 2020-06-07 10:18:25 发布 · 311 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于判断两个字符串是否为同构字符串。即一个字符串中的字符是否可以替换得到另一个字符串，要求所有出现的字符都必须用另一个字符替换，并保持字符的原有顺序不变。文章通过一个具体的C++实现案例展示了如何高效地解决这一问题。

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.

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