leetcode - Isomorphic Strings

最新推荐文章于 2025-09-07 20:32:33 发布

weixin_30848775

最新推荐文章于 2025-09-07 20:32:33 发布

阅读量102

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/shnj/p/4494947.html

本文探讨了LeetCode上的同构字符串问题，并提供了一种利用哈希表进行判断的解决方案。通过对输入字符串s和t的遍历，确保两者间字符的一一对应关系，即s中的字符映射到t中唯一确定的字符。

leetcode - 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.

 1 class Solution {
 2 public:
 3     bool isIsomorphic(string s, string t) {
 4         int sHashtable[256]={0};
 5         int tHashtable[256]={0};
 6         int len = s.size();
 7         for(int i=0; i<len; i++){
 8             if(sHashtable[s[i]]==0){
 9                 if(tHashtable[t[i]]==0){
10                     sHashtable[s[i]]=t[i];
11                     tHashtable[t[i]]=s[i];
12                 }
13                 else return 0;
14             }
15             else
16             if(sHashtable[s[i]]!=t[i]) return 0;//same char map to different chars
17         }
18         return 1;
19     }
20 };