Leetcode Isomorphic Strings

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.

Difficulty:Easy

Solution: Use Hashtable, not hard.

import java.util.Hashtable;

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        int len = s.length();
        Hashtable<Character, Character> ht = new Hashtable<Character, Character>();
        for(int i = 0; i < len; i++){
            if(ht.containsKey(s.charAt(i))){
                if(ht.get(s.charAt(i)) != t.charAt(i)){
                    return false;
                }
            }
            else if(ht.containsValue(t.charAt(i))){
                return false;
                
            }
            else{
                ht.put(s.charAt(i), t.charAt(i));
            }
        }
        return true;
    }
}