205. Isomorphic Strings

题目摘要
给出两个长度相同的字符串，判断他们结构是否相同。
示例：

"egg", "add"相同
"foo", "bar"不同
"paper", "title"相同

解法
可以考虑新建一个512位的整形数组，前面一半存字符串1每个字符上次出现的位置+1，后一半存字符串2每个字符上次出现的位置+1。

注意

• 位置需要+1，因为数组自动初始化为0
• ascall码表字符有2^8=256个

可问问题
字符是否全是ascall码表中的字符

原题
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.