[LeetCode]--205. Isomorphic Strings（同构字符串）

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.

方法一：用一个转换函数，将我们现在的字符串弄成0123…替代的字符串，比如abcca为01220，最后比较转换出来的字符串是否相等。

public boolean isIsomorphic1(