【leetcode】Isomorphic Strings【java】

题目：

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.

思路：

s字符串中的字符一旦与t字符串中的字符匹配后就不能再与其他的字符匹配，通过建立一个哈希表来存储s字符串中字符与t中字符串之间的关系来判断是否满足题目要求

代码：