当前位置：网站首页>338 leetcode isomorphic string

338 leetcode isomorphic string

2022-04-21 16:56:00 【sp_ thirteen billion two hundred and thirty million four hundre】

Insert picture description here 

class Solution
{
    
public:
	bool isIsomorphic(string s, string t)
	{
    
		unordered_map<char, char> st;
		unordered_map<char, char> ts;
		int len = s.size();
		for (int i = 0; i < len; ++i)
		{
    
			char x = s[i], y = t[i];
			if ((st.count(x) && st[x] != y) || (ts.count(y) && ts[y] != x))
			{
    
				return false;
			}
			st[x] = y;
			ts[y] = x;
		}
		return true;
	}
};

Time complexity ：O(n), among n Is the length of the string . We just need to traverse the string at the same time s and t that will do
Spatial complexity ：O(∣Σ∣), among Σ Is the character set of a string . The space in which the hash table stores characters depends on the character set size of the string , In the worst case, each character is different , need O(∣Σ∣) Space

版权声明
本文为[sp_ thirteen billion two hundred and thirty million four hundre]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204211655278457.html

边栏推荐

猜你喜欢

随机推荐