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.

思路：用哈希表一一匹配两个字符串的字符即可

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