LeetCode-205-Isomorphic Strings-E

最新推荐文章于 2024-10-31 16:45:22 发布

文卿的藏剑山庄

最新推荐文章于 2024-10-31 16:45:22 发布

阅读量146

点赞数

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

本文链接：https://blog.csdn.net/qq_37651325/article/details/79460816

版权

leetcode 专栏收录该内容

142 篇文章 1 订阅

订阅专栏

本文介绍了一种算法，用于判断两个字符串是否为同构字符串。即一个字符串中的字符是否可以替换得到另一个字符串，同时所有出现的字符都必须用另一字符替换，并保持字符顺序不变。文章通过示例展示了如何进行判断，并提供了一个具体的实现代码。

摘要由CSDN通过智能技术生成

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.

代码：

bool isIsomorphic(string s, string t) {
        int m1[128] = {0}, m2[128] = {0}, n = s.size();
        for (int i = 0; i < n; ++i) {
            if (m1[s[i]] != m2[t[i]]) return false;
            m1[s[i]] = i + 1;
            m2[t[i]] = i + 1;
        }
        return true;
    }