@@ -0,0 +1,889 @@
+%22%22%22%0AGiven two strings s and t, determine if they are isomorphic.%0A%0ATwo strings are isomorphic if the characters in s can be replaced to get t.%0A%0AAll 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.%0A%0AFor example,%0AGiven %22egg%22, %22add%22, return true.%0A%0AGiven %22foo%22, %22bar%22, return false.%0A%0AGiven %22paper%22, %22title%22, return true.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def isIsomorphic(self, s, t):%0A        %22%22%22%0A        :type s: str%0A        :type t: str%0A        :rtype: bool%0A        %22%22%22%0A        if len(s)!=len(t):%0A            return False%0A        dict=%7B%7D%0A    %0A        for i in range(len(s)):%0A            if dict.has_key(s%5Bi%5D):%0A                if dict%5Bs%5Bi%5D%5D!=t%5Bi%5D:%0A                    return False%0A            else:%0A                dict%5Bs%5Bi%5D%5D=t%5Bi%5D%0A        return True%0A

Create LeetCode-IsomorphicStrings.py