[leetcode]Isomorphic Strings

最新推荐文章于 2020-06-07 10:18:25 发布

原创最新推荐文章于 2020-06-07 10:18:25 发布 · 321 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一个LeetCode上的问题——如何判断两个字符串是否为同构字符串。通过使用C++实现的具体算法，展示了如何确保一个字符串可以通过字符替换的方式转换成另一个字符串，并保持字符出现的顺序不变。

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

题目来源：https://leetcode.com/problems/isomorphic-strings/

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) {
        map<int,int> mapst, mapts;
		int len = s.size(), sc, tc;
        for(int i=0; i<len; i++) {
            sc = s[i]-'a'+1;
            tc = t[i]-'a'+1;
            if(mapst[sc]==0) mapst[sc] = tc;
            if(mapts[tc]==0) mapts[tc] = sc;
            if(mapst[sc]!=tc || mapts[tc]!=sc) {
                return false;
            }
        }
        return true;
    }
};