Isomorphic Strings - LeetCode 205

最新推荐文章于 2022-05-06 14:10:50 发布

bu_min

最新推荐文章于 2022-05-06 14:10:50 发布

阅读量365

点赞数

分类专栏： OJ 文章标签： leetcode hashmap

本文链接：https://blog.csdn.net/bu_min/article/details/45851877

版权

OJ 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

题目描述：
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.
Hide Tags Hash Table

分析：设置两个hashmap，分别存放s[i]到 t[i]和t[i]到 s[i]的映射，然后边存变检查是都一致。
但是效率有点低啊,破历史新低。后期会做出改进。

以下是C++实现代码，思路比较简单。

/*///60ms/史上耗时最多的一次//*/
class Solution {
public:
    bool isIsomorphic(string s, string t) {
          if(s.size() != t.size())
			return false;
      
        map<char,char> m1;
        map<char,char> m2;
        int size = s.size();
        map<char,char>::iterator itr;
        for(int i = 0; i!= size; i++)
        {
	     
            if((itr= m1.find(s[i]))!= m1.end())
            {
				if(itr->second != t[i])
					return false;
            }
			else
				 m1.insert(make_pair(s[i],t[i]));
			if((itr = m2.find(t[i])) != m2.end())
            {                
                 if(itr->second != s[i])
					return false;
            }
			else			
				m2.insert(make_pair(t[i],s[i]));		         			
        }
        
        return true;
    }
};