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

解题思路

建立两个表:
①从字符串s到字符串t的字符映照表,由于最大的字母为122,因此映照表的大小为123。映照表键值为s中的字符,value为t中对应位置的字符。
②isUsed表代表t中的该字符是不是已被作为s中某字符的value值。

实现代码

#include <iostream>
using namespace std;

//Runtime:12ms
class Solution {
public:
bool isIsomorphic(string s, string t) {
int len = s.size();
unsigned char map[123] = {0};
bool isUsed[123] = {0};
for (int i = 0; i < s.size(); i++)
{
if (map[s[i]] == 0)
{
if (!isUsed[t[i]])
{
map[s[i]] = t[i];
isUsed[t[i]] = true;
}
else
{
return false;
}
}
else if (map[s[i]] != t[i])
{
return false;
}
}

return true;
}
};

int main()
{
Solution s;
cout<<s.isIsomorphic("aba", "baa")<<endl;
cout<<s.isIsomorphic("egg", "add")<<endl;
cout<<s.isIsomorphic("foo", "bar")<<endl;
cout<<s.isIsomorphic("paper", "title")<<endl;
}

波比源码 – 精品源码模版分享 | www.bobi11.com
1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长!
2. 分享目的仅供大家学习和交流,您必须在下载后24小时内删除!
3. 不得使用于非法商业用途,不得违反国家法律。否则后果自负!
4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解!
5. 如有链接无法下载、失效或广告,请联系管理员处理!
6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需!
7. 如遇到加密压缩包,请使用WINRAR解压,如遇到无法解压的请联系管理员!

波比源码 » [LeetCode] Isomorphic Strings

发表评论

Hi, 如果你对这款模板有疑问,可以跟我联系哦!

联系站长
赞助VIP 享更多特权,建议使用 QQ 登录
喜欢我嘛?喜欢就按“ctrl+D”收藏我吧!♡