[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.

Note:
You may assume both s and t have the same length.

方法1（省空间）：

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

方法2（省时间，转自Leetcode wtsanshou）：

public boolean isIsomorphic(String s, String t) {
        char[] ss = s.toCharArray();
        char[] tt = t.toCharArray();
        int[] sAddr = new int[128];
        int[] tAddr = new int[128];
        for(int i=0; i<s.length(); ++i) {
            if(sAddr[ss[i]] != tAddr[tt[i]])
                return false;
            else if(sAddr[ss[i]] == 0)
                sAddr[ss[i]] = tAddr[tt[i]] = i+1;
        }
        return true;
    }