Given two strings str1
and str2
of the same length, determine whether you can transform str1
into str2
by doing zero or more conversions.
In one conversion you can convert all occurrences of one character in str1
to any other lowercase English character.
Return true
if and only if you can transform str1
into str2
.
Example 1:
Input: str1 = "aabcc", str2 = "ccdee" Output: true Explanation: Convert 'c' to 'e' then 'b' to 'd' then 'a' to 'c'. Note that the order of conversions matter.
Example 2:
Input: str1 = "leetcode", str2 = "codeleet" Output: false Explanation: There is no way to transform str1 to str2.
class Solution:
def canConvert(self, str1: str, str2: str) -> bool:
hashmap = {}
hashset = set()
for i in range(len(str1)):
hashset.add(str2[i])
if str1[i] in hashmap and hashmap[str1[i]] != str2[i]:
return False
hashmap[str1[i]] = str2[i]
if str1 != str2 and len(hashset) == 26 and len(hashmap) == 26:
return False
return True
O(n) and O(n)
https://www.thaisport88.com/ทางเข้า-w88
ReplyDeletew88, w88 ทางเข้า, w888, w88club, w88th