Commit 533e8b9

committed

49. Group Anagrams

1 parent d4146e9 commit 533e8b9Copy full SHA for 533e8b9

File tree

+11

-0

lines changed

+11

-0

lines changed

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -41,6 +41,12 @@`
`41`	`41`	`# Total Complexity: O(N log N + N K log K)`
`42`	`42`	`# Space Complexity: O(N K)`
`43`	`43`
	`44`	`+'''`
	`45`	`+In the below approach, we sorted the strings in order to identify if they are anagrams.`
	`46`	`+We then used a dictionary to store the sorted strings as key and the original strings as values.`
	`47`	`+Finally we returned the values of the dictionary.`
	`48`	`+'''`
	`49`	`+`
`44`	`50`	`class Solution:`
`45`	`51`	`def groupAnagrams(self, strs):`
`46`	`52`	`new_val = sorted(strs)`
`@@ -59,6 +65,11 @@ def groupAnagrams(self, strs):`
`59`	`65`	`# Time Complexity: O(m*n)`
`60`	`66`	`# Space Complexity: O(m)`
`61`	`67`
	`68`	`+'''`
	`69`	`+In the below approach, we used a dictionary to store the count of each character in the string as key and the original string as value.`
	`70`	`+Finally we returned the values of the dictionary.`
	`71`	`+'''`
	`72`	`+`
`62`	`73`	`from collections import defaultdict`
`63`	`74`
`64`	`75`	`class Solution:`

Comments

(0)