leetcode 205 Isomorphic Strings

最新推荐文章于 2025-08-09 17:01:50 发布

原创最新推荐文章于 2025-08-09 17:01:50 发布 · 263 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #character #algorithm

leetcode 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种使用双哈希表的方法来判断两个字符串是否为同构字符串。通过将字符串中的字符映射为新的字符，若两个字符串经过相同映射规则后的结果相同，则这两个字符串为同构字符串。

摘要生成于 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 gett.

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.

题目思路：

具体思路是使用两个Hash Map来跟踪两个字符串，待整理，先贴出来代码，代码如下：

class Solution {
public:
    string transferStr(string s){
        char table[128] = {0};
        char tmp = '0';
        for(int i =0; i<s.length(); i++){
            char c =s.at(i);
            if(table[c] == 0){
                table[c] = tmp++;
            }
            s[i] =table[c];
        }
        return s;
    }
    bool isIsomorphic(string s, string t) {
        
        if(s.length() != t.length()){
            return false;
            
        }   
        if(transferStr(s) == transferStr(t)){
            return true;
        }
        return false;
    }
};