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.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | public static boolean isIsomorphic(String s, String t) { if (s== null && t== null ) return true ; else if (s.length()!=t.length()) return false ; Map<Character,Character> hm= new HashMap<Character,Character>(); for ( int i= 0 ;i<s.length();i++) { if (hm.containsKey(s.charAt(i))) { if (hm.get(s.charAt(i))!=t.charAt(i)) return false ; } else if (hm.containsValue(t.charAt(i))) return false ; //开始的时候忘了这个条件,要注意一下 else hm.put(s.charAt(i), t.charAt(i)); } return true ; } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步