Java Solution Using Hashmap


  • 0
    D
        public boolean isIsomorphic(String s, String t) {
    
            Map<Character,Character> map = new HashMap<>();
            for (int i = 0; i < s.length(); i++) {
                char a = s.charAt(i);
                char b = t.charAt(i);
                if (map.containsKey(a)){
                    if (!map.get(a).equals(b)) {return false;}
                }
                else {
                    if (! map.containsValue(b)){map.put(a,b);}
                    else {return false;}
                }
                
            }
            return true;

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.