LeetCode——Isomorphic Strings

最新推荐文章于 2021-11-11 12:14:17 发布

梅子黄时_宿于松下

最新推荐文章于 2021-11-11 12:14:17 发布

阅读量372

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签：算法 leetcode

本文链接：https://blog.youkuaiyun.com/cshun1990/article/details/46406369

数据结构与算法专栏收录该内容

36 篇文章

订阅专栏

本文介绍了一个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) {
        const int kNotChar = 256;
        const int kCharNum = 256;
        vector<int> vec(kCharNum, kNotChar);
        bitset<kCharNum> bset;
        for(size_t i = 0; i != s.length(); ++i) {
            if(vec[s[i]] == kNotChar && !bset[t[i]]) {
                vec[s[i]] = t[i];
                bset[t[i]] = 1;
            } else if (vec[s[i]] == kNotChar && bset[t[i]]) {
                return false;
            } else if (vec[s[i]] != t[i]) {
                return false;
            }
        }

        return true;
    }
};