[Leetcode]205. Isomorphic Strings

原创于 2016-07-13 19:30:37 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种判断两个字符串是否为同构字符串的方法。通过使用双向映射的方式，确保了字符之间的对应关系既具有一致性又具备唯一性。文章提供了一个具体的C++实现案例。

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

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