LeetCode 0205 - Isomorphic Strings
Isomorphic Strings
Desicription
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.
Example 1:
1 | Input: s = "egg", t = "add" |
Example 2:
1 | Input: s = "foo", t = "bar" |
Example 3:
1 | Input: s = "paper", t = "title" |
Note:
You may assume both s and t have the same length.
Solution
1 | class Solution { |