leetcode 205. Isomorphic Strings

最新推荐文章于 2025-12-31 20:36:24 发布

原创最新推荐文章于 2025-12-31 20:36:24 发布 · 419 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

本文探讨了如何通过字符映射的方法来判断两个字符串是否等价，详细解释了字符替换规则和映射关系的重要性。通过实例演示了判断过程，包括给出的示例如egg和add、foo和bar、paper和title，以及算法实现细节，如使用哈希表和集合来确保映射的唯一性和一致性。

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) {
		if (s.length() != t.length())
			return false;
		unordered_map<char, char>transmap;
		set<char>hist;
		for (int i = 0; i < s.length(); i++)
		{
			if (transmap.find(s[i]) == transmap.end())
			{
				if (hist.find(t[i]) == hist.end())
				{
					transmap[s[i]] = t[i];
					hist.insert(t[i]);
				}
				else
					return false;
			}
			else
			{
				if (transmap[s[i]] != t[i])
					return false;
			}
		}
		return true;
	}
};