205_IsomorphicStrings

题目：

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.

思想：

采用两个hash表记录每个字符所对应的使用的个数。通过题目可知，只需要了解个数是否相等即可，无需记录具体为多少。通过映射关系若发现某位置相应“字符个数”不相等则无法映射。

代码：

bool isIsomorphic(string s, string t) {
		int len = s.size();
		if (len!=t.size()){
			return false;
		}else if (len==0){
			return true;
		}
		else{
			char s_map[128] = { 0 };
			char t_map[128] = { 0 };
			for (int i = 0; i < len; i++)
			{
				if (s_map[s[i]] != t_map[t[i]])
				{
					return false;
				}
				else
				{
					s_map[s[i]] = i+1;//保证每个字符对应的“个数”不一样
					t_map[t[i]] = i+1;
				}
			}
			return true;
		}
	}