205. 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.
题目大意：
判断两个字符串是否相似。
思路：
使用双map来进行比较。map键为字符串元素，值为字符上一次出现的位置。
代码如下：
class Solution {
public:
bool isIsomorphic(string s, string t) {
if(s.size() != t.size())
return false;
unordered_map maps;
unordered_map mapt;
for(int i = 0;i < s.size();i++)
{
if(maps.find(s[i]) == maps.end() && mapt.find(t[i]) == mapt.end())
{
maps.insert(pair(s[i],i));
mapt.insert(pair(t[i],i));
}
else if(maps.find(s[i]) != maps.end() && mapt.find(t[i]) != mapt.end())
{
if(maps[s[i]] != mapt[t[i]])
return false;
else
{
maps[s[i]] = i;
mapt[t[i]] = i;
}
}
else
return false;
}
return true;
}
}; 2016-08-13 17:15:21
