-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1657.determine-if-two-strings-are-close.py
94 lines (90 loc) · 2.03 KB
/
1657.determine-if-two-strings-are-close.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#
# @lc app=leetcode id=1657 lang=python3
#
# [1657] Determine if Two Strings Are Close
#
# https://leetcode.com/problems/determine-if-two-strings-are-close/description/
#
# algorithms
# Medium (54.10%)
# Likes: 3858
# Dislikes: 325
# Total Accepted: 439.8K
# Total Submissions: 812.9K
# Testcase Example: '"abc"\n"bca"'
#
# Two 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
#
#
# 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 (all a's turn into b's, and all b's turn into
# a's)
#
#
#
#
# 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 <= 10^5
# word1 and word2 contain only lowercase English letters.
#
#
#
# @lc code=start
from collections import Counter
class Solution:
def closeStrings(self, word1: str, word2: str) -> bool:
if set(word1) != set(word2):
return False
c_word1 = Counter(word1)
c_word2 = Counter(word2)
return sorted(c_word1.values()) == sorted(c_word2.values())
# @lc code=end