LeetCode 솔루션 분류
[12/2] 1657. Determine if Two Strings Are Close
본문
1657. Determine if Two Strings Are Close
Medium
195192Add to ListShareTwo strings are considered close if you can attain one from the other using the following operations:
- Operation 1: Swap any two existing characters.
- For example,
abcde -> aecdb
- For example,
- Operation 2: Transform every occurrence of one existing character into another existing character, and do the same with the other character.
- For example,
aacabb -> bbcbaa(alla's turn intob's, and allb's turn intoa's)
- For example,
You can use the operations on either string as many times as necessary.
Given two strings, word1 and word2, return true if word1 and word2 are close, and false otherwise.
Example 1:
Input: word1 = "abc", word2 = "bca" Output: true Explanation: You can attain word2 from word1 in 2 operations. Apply Operation 1: "abc" -> "acb" Apply Operation 1: "acb" -> "bca"
Example 2:
Input: word1 = "a", word2 = "aa" Output: false Explanation: It is impossible to attain word2 from word1, or vice versa, in any number of operations.
Example 3:
Input: word1 = "cabbba", word2 = "abbccc"
Output: true
Explanation: You can attain word2 from word1 in 3 operations.
Apply Operation 1: "cabbba" -> "caabbb"
Apply Operation 2: "caabbb" -> "baaccc"
Apply Operation 2: "baaccc" -> "abbccc"
Constraints:
1 <= word1.length, word2.length <= 105word1andword2contain only lowercase English letters.
Accepted
96,932
Submissions
171,610
태그
#Postmates
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
from collections import Counter
class Solution:
def closeStrings(self, word1: str, word2: str) -> bool:
c1 = Counter(word1)
c2 = Counter(word2)
if set(word1) == set(word2) and list(sorted(c1.values())) == list(sorted(c2.values())):
return True
return False
