매핑

[LeetCode] 205. Isomorphic Strings (Daily Question)

문제 Given two strings s and t, determine if they are isomorphic. Two strings s and t 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. 주어진 두 문자열 s, t가 같은 구조인지 판별하는 문제이다. 예를 들면, egg와 add는 구..