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.
同型字符串
public class Solution { public boolean isIsomorphic(String s, String t) { Map<Character,Integer> sm=new HashMap<>(); Map<Character,Integer> tm=new HashMap<>(); for(Integer i=0;i<s.length();i++)//这里必须要注意是Integer不是int { if(sm.put(s.charAt(i),i)!=tm.put(t.charAt(i),i)) return false; } return true; } }
