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.

给你两个字符串，判断映射是否相等。使用HashMap每个s的字符（key）都对应唯一的t的字符（value），否则false。

package leetcode;

import java.util.HashMap;

public class IsomorphicStrings {

public boolean isIsomorphic(String s, String t) {

boolean ans = true;

//Set<char,char> map = new HashSet<char,char>();

HashMap<Integer , Integer> map = new HashMap<Integer , Integer>();

char[] chars = s.toCharArray();

char[] chart = t.toCharArray();

for (int i = 0; i<s.length(); i++){

if (map.containsKey((int)chars[i])){

if (map.get((int)chars[i]) != (int)chart[i]) return false;

}else{

map.put((int)chars[i],(int)chart[i]);

}

}

map.clear();

for (int i = 0; i<s.length(); i++){

if (map.containsKey((int)chart[i])){

if (map.get((int)chart[i]) != (int)chars[i]) return false;

}else{

map.put((int)chart[i],(int)chars[i]);

}

}

return ans;

    }

public static void main(String[] args) {

// TODO Auto-generated method stub

System.out.println(new IsomorphicStrings().isIsomorphic("foo", "bar"));

}

}