[Leetcode] 205. Isomorphic Strings problem solving ideas-Java

Given strings s and t, determine if they are isomorphic.

The strings is isomorphic if the characters in s can is replaced to get t.

All occurrences of a character must is replaced with another character while preserving the order of characters. No, characters may map to the same character and a character may map to itself.

For example,
Given "egg" , "add" return True.

Given "foo" , "bar" return FALSE.

Given "paper" , "title" return True.

Note:
Assume both s and T have the same length.

Question: Given two strings, determine if they are isomorphic.

When a character in the string s can be substituted to get another string T, then the string s and T are isomorphic.

Import static Java.lang.system.out;import Java.util.hashtable;public class Solution {public Boolean isisomorphic (Strin G S, String t) {
Hashtable<character, character> s_t = new Hashtable<character, character>(); Hashtable<character, character> t_s = new Hashtable<character, character>(); intLength =s.length ();  for(inti =0; i < length; i++){
Character SS=S.charat (i); Character TT=T.charat (i); if(S_t.containskey (ss) | |T_s.containskey (TT)) {                                                if(S_t.get (ss) = = TT && t_s.get (TT) = =SS)                {continue; }Else{returnfalse; }            }Else{s_t.put (ss, TT);            T_s.put (TT, SS); }} returntrue; }}

[Leetcode] 205. Isomorphic Strings problem solving ideas-Java