Isomorphic Strings

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

key2value

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

阅读量871

点赞数

分类专栏：算法文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u010786672/article/details/45399507

版权

算法专栏收录该内容

83 篇文章

订阅专栏

本文详细介绍了如何判断两个给定的字符串是否互为同构，即字符映射规则相同且保持相对位置不变。通过实现一个算法，确保字符之间的映射关系一致，从而验证两个字符串是否具有同构性质。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 len1=s.length();
        map<char,char> m;
        map<char,char> m2;
        for(int i=0;i<len1;i++){
            if(m.find(s[i])==m.end()&&m2.find(t[i])==m2.end()){
                m[s[i]]=t[i];
                m2[t[i]]=s[i];
            }else if(m[s[i]]!=t[i]||m2[t[i]]!=s[i]){
                return false;
            }
        }
        return true;
    }
};