Isomorphic Strings

最新推荐文章于 2020-08-14 13:12:31 发布

原创最新推荐文章于 2020-08-14 13:12:31 发布 · 174 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode之旅同时被 2 个专栏收录

65 篇文章

订阅专栏

c++

29 篇文章

订阅专栏

本文介绍了一种算法，用于判断两个字符串是否为同构字符串。即一个字符串中的字符是否可以替换得到另一个字符串，同时保持字符出现的顺序不变。文章提供了一个具体的C++实现案例。

摘要生成于 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();
        int len2=t.length();
        if(len1!=len2){
            return false;
        }
        char charMap[256];
        char charMap1[256];
        memset(charMap, 0, sizeof(char)*256);
        memset(charMap1, 0, sizeof(char)*256);
        for(int i=0; i<len1; i++){
            if(charMap[s[i]]==0){
                charMap[s[i]] = t[i];
            }else if(charMap[s[i]]!=t[i]){
                return false;
            }
            if(charMap1[t[i]]==0){
                charMap1[t[i]] = s[i];
            }else if(charMap1[t[i]]!=s[i]){
                return false;
            }
        }
        return true;
    }
};