-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1657.确定两个字符串是否接近.py
41 lines (36 loc) · 1.09 KB
/
1657.确定两个字符串是否接近.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
#
# @lc app=leetcode.cn id=1657 lang=python
#
# [1657] 确定两个字符串是否接近
#
# @lc code=start
class Solution(object):
def closeStrings(self, word1, word2):
"""
:type word1: str
:type word2: str
:rtype: bool
"""
dic_word1 = {}
dic_word2 = {}
if len(dic_word1) != len(dic_word2):
return False
for i in range(len(word1)):
dic_word1[word1[i]] = dic_word1.get(word1[i], 0) + 1
dic_word2[word2[i]] = dic_word2.get(word2[i], 0) + 1
key_of_word1 = dic_word1.keys()
key_of_word2 = dic_word2.keys()
key_of_word1.sort()
key_of_word2.sort()
for i in range(len(key_of_word1)):
if key_of_word1[i] != key_of_word2[i]:
return False
num_of_word1 = dic_word1.values()
num_of_word2 = dic_word2.values()
num_of_word1.sort()
num_of_word2.sort()
for i in range(len(num_of_word1)):
if num_of_word1[i] != num_of_word2[i]:
return False
return True
# @lc code=end