mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
更新代码规范
This commit is contained in:
@ -137,16 +137,16 @@ class Solution:
|
||||
def isAnagram(self, s: str, t: str) -> bool:
|
||||
from collections import defaultdict
|
||||
|
||||
s_dict=defaultdict(int)
|
||||
t_dict=defaultdict(int)
|
||||
s_dict = defaultdict(int)
|
||||
t_dict = defaultdict(int)
|
||||
|
||||
for x in s:
|
||||
s_dict[x]+=1
|
||||
s_dict[x] += 1
|
||||
|
||||
for x in t:
|
||||
t_dict[x]+=1
|
||||
t_dict[x] += 1
|
||||
|
||||
return s_dict==t_dict
|
||||
return s_dict == t_dict
|
||||
```
|
||||
|
||||
Go:
|
||||
|
Reference in New Issue
Block a user