FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithms/string/group_anagrams.py at master · smitsgit/algorithms · GitHub
smitsgit
/
algorithms
Public
forked from
keon/algorithms
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithms
/
string
/
group_anagrams.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
29 lines (25 loc) · 588 Bytes
Breadcrumbs
algorithms
/
string
/
group_anagrams.py
Copy path
File metadata and controls
29 lines (25 loc) · 588 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
"""
Given an array of strings, group anagrams together.
For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],
Return:
[
["ate", "eat","tea"],
["nat","tan"],
["bat"]
]
"""
class
Solution
(
object
):
def
groupAnagrams
(
self
,
strs
):
d
=
{}
ans
=
[]
k
=
0
for
str
in
strs
:
sstr
=
''
.
join
(
sorted
(
str
))
if
sstr
not
in
d
:
d
[
sstr
]
=
k
k
=
k
+
1
ans
.
append
([])
ans
[
-
1
].
append
(
str
)
else
:
ans
[
d
[
sstr
]].
append
(
str
)
return
ans
Back
|
FazBrowse Home
|
New Git URL