[Leetcode 205] Isomorphic Strings

Title Link: isomorphic-strings

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.

29/29 test Cases passed.//status:accepted//runtime:390 ms//submitted:1 minute Agopublic class Solution {    PU Blic Boolean isisomorphic (string s, String t) {        map<character, character> sm = new Hashmap<character, charact Er> ();        Map<character, character> tm = new Hashmap<character, character> ();        for (int i = 0; i < s.length (); i++) {Char char_s = S.charat (i); char char_t = T.charat (i); if (Sm.get (char_s) = = null) {i F (tm.get (char_t) = = null) {Sm.put (char_s, char_t); Tm.put (char_t, char_s);} Elsereturn false;} else {if (Tm.get (char_t) = = null) return False;if (! ( Sm.get (char_s) = = char_t && tm.get (char_t) = = char_s) return false;}}        return true;    }}

[Leetcode 205] Isomorphic Strings