模式相同的字符串 Isomorphic Strings

最新推荐文章于 2024-07-31 17:05:31 发布

weixin_33698823

最新推荐文章于 2024-07-31 17:05:31 发布

阅读量68

点赞数

文章标签： python

原文链接：https://my.oschina.net/liyurong/blog/920551

版权

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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.

解决：

①使用map保存字母之间的映射关系，但是注意，只能是一对一的映射，所以要避免多对一映射。我使用了hashset的add方法的特性。耗时24ms.性能不是很好。

public class Solution {
public boolean isIsomorphic(String s, String t) {
char[] schar = s.toCharArray();
char[] tchar = t.toCharArray();
if (schar.length != tchar.length) {
   return false;
}
Map<Character,Character> map = new HashMap<>();
Set<Character> set = new HashSet<>();
for (int i = 0;i < schar.length ;i ++ ) {
   if(map.get(schar[i]) == null){
   if(set.add(tchar[i])){//避免映射重复，value不能重复"ab"，"aa"=>false
   map.put(schar[i],tchar[i]);
   }else{
   return false;
   }
   }
   if(map.get(schar[i]) != null && map.get(schar[i]) == tchar[i]){
   continue;
   }
   if(map.get(schar[i]) != null && map.get(schar[i]) != tchar[i] ){
   return false;
   }
}
return true;
}
}

②思路同上面一样，只是使用自己编写的hash table。耗时6ms.

public class Solution {
public boolean isIsomorphic(String s, String t) {
char[] schar = s.toCharArray();
char[] tchar = t.toCharArray();
if(schar.length != tchar.length) return false;
char[] hash = new char[256];
Set<Character> set = new HashSet<>();//保存已经映射了的t字符串中的字符
for (int i = 0;i < schar.length ;i ++ ) {
   if (hash[(int)schar[i]] == 0) {//还没有建立映射关系,不能是='0'
       if (set.contains(tchar[i])) {//已经映射过了
           return false;
       }else{
           hash[(int)schar[i]] = tchar[i];
           set.add(tchar[i]);
       }
   }else{
       if (hash[(int)schar[i]] != tchar[i]) {
           return false;
       }
   }
}
return true;
}
}