245. Isomorphic Strings

Given two strings s and t, return true if they are isomorphic — characters in s can be replaced to get t with a consistent one-to-one mapping (no two characters map to the same character, and each maps to exactly one). Input: '"s", "t"'.

Input: '"s", "t"'.

Output: Boolean — true or false.

Examples

Input: "egg", "add"
Output: true
Explanation: e->a, g->d.

Input: "foo", "bar"
Output: false
Explanation: o maps to both a and r.

Input: "paper", "title"
Output: true
Explanation: Consistent mapping.

Constraints

• 1<=s.length<=5*10^4
• s.length==t.length

Asked by