205. Isomorphic Strings

最新推荐文章于 2024-05-28 22:33:11 发布

zg1g

最新推荐文章于 2024-05-28 22:33:11 发布

阅读量793

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 哈希数组

本文链接：https://blog.csdn.net/daigualu/article/details/71357419

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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.

代码实现

 public bool IsIsomorphic(string s, string t)
        {
            var dict = new Dictionary<char, char>(); //s.char->t.char
            var dict2 = new Dictionary<char, char>(); //t.char->s.char
            for (int i = 0; i < s.Length; i++)
            {
                if (dict.ContainsKey(s[i]) && dict[s[i]] != t[i] ||
                   dict2.ContainsKey(t[i]) && dict2[t[i]] != s[i])
                    return false;
                dict[s[i]] = t[i];
                dict2[t[i]] = s[i];
            }
            return true;
        }