问题描述:
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.
分析:这道题比较简单,之前以为只有字符,然后希望用两个26长度的数组来实现映射功能,发现除了字符之外还是数字,后来干脆用hashmap现成的数据结构来实现映射功能。
代码如下:388ms
public class Solution {
public boolean isIsomorphic(String s, String t) {
HashMap<Character,Character> maps = new HashMap<>();
int length = s.length();
if(length!=t.length())
return false;
char[] schar = s.toCharArray();
char[] tchar = t.toCharArray();
for(int i = 0;i<length;i++){
char sval = schar[i];
char tval = tchar[i];
if(maps.containsKey(sval)){
char tmp = maps.get(sval);
if(tmp!=tval)
return false;
}else{
if(maps.containsValue(tval))//multi map
return false;
maps.put(sval,tval);
}
}
return true;
}
}