cKK

............当你觉得自己很辛苦,说明你正在走上坡路.............坚持做自己懒得做但是正确的事情,你就能得到别人想得到却得不到的东西............

导航

(String) 205.Isomorphic Strings

Posted on   cKK  阅读(179)  评论(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 "egg""add", return true.

Given "foo""bar", return false.

Given "paper""title", return true.

 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
public static boolean isIsomorphic(String s, String t) {
     if(s==null && t==nullreturn true;
     else if(s.length()!=t.length())  return false;
     Map<Character,Character> hm=new HashMap<Character,Character>();
     for(int i=0;i<s.length();i++) {
         if(hm.containsKey(s.charAt(i))) {
             if(hm.get(s.charAt(i))!=t.charAt(i))
                 return false;
         }
         else if(hm.containsValue(t.charAt(i)))
             return false;   //开始的时候忘了这个条件,要注意一下
         else
             hm.put(s.charAt(i), t.charAt(i));
     }
     return true;
   }

  

努力加载评论中...
点击右上角即可分享
微信分享提示