# leetcode 205:Isomorphic Strings

87人阅读 评论(0)

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 “foo”, “bar”, return false.

Given “paper”, “title”, return true.

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

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class IsomorphicStrings {
/**
*
* @param s
* @param t
* @return
*/
public static boolean isIsomorphic(String s,String t){
if(s==null || t==null) return false;
if(s.length()!=t.length()) return false;
Map<Character,Character> map=new HashMap<Character,Character>();
Set<Character> set=new HashSet<Character>();
for(int i=0;i<s.length();i++){
char c1=s.charAt(i);
char c2=t.charAt(i);
if(map.containsKey(c1)){
if(map.get(c1)!=c2) return false;
}else{
if(set.contains(c2)) return false;
else{
map.put(c1, c2);
}
}
}
return true;
}
public static void main(String[] args){
String s="egg";
boolean result=isIsomorphic(s,t);
System.out.println("result:"+result);
}

}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：8499次
• 积分：400
• 等级：
• 排名：千里之外
• 原创：33篇
• 转载：2篇
• 译文：0篇
• 评论：0条
阅读排行
评论排行