leetcode 205 Isomorphic Strings

最新推荐文章于 2024-07-22 14:04:18 发布

原创最新推荐文章于 2024-07-22 14:04:18 发布 · 365 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种算法，用于判断两个字符串是否为同构字符串。即一个字符串中的字符是否可以替换得到另一个字符串，要求所有出现的字符都必须用另一个字符替换，并保持字符的顺序不变。

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.

Subscribe to see which companies asked this question

class Solution {
public:
	bool isIsomorphic(string s, string t) {
		vector<char> maps(255, 0);
		vector<int> visited(255, 0);

		for(int i = 0; i < s.length(); i++) {
			if(maps[s[i]]!=0) {
				if(maps[s[i]] != t[i]) return false;
			} else {
				if(visited[t[i]] == 1) return false;

				maps[s[i]]=t[i];
				visited[t[i]]=1;
			}
		}

		return true;
	}
}