Commit 971f133

committed

Update

1 parent 8e276d3 commit 971f133Copy full SHA for 971f133

File tree

+31

-15

lines changed

+31

-15

lines changed

Lines changed: 11 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,21 @@`
`1`	`1`	`from typing import List`
`2`		`-`
	`2`	`+fromcollectionsimportdefaultdict`
`3`	`3`	`# ---------------------- Solution 1 -----------------------`
`4`	`4`
`5`	`5`	`class Solution:`
`6`	`6`	`def groupAnagrams(self, strs: List[str]) -> List[List[str]]:`
`7`		`- ls = []*len(strs)`
`8`		`- for i in range(len(strs)):`
`9`		`- sls = sorted(strs[i])`
`10`		`- for j in range(len(strs)):`
`11`		`- if sls == sorted(strs[j]):`
`12`		`- ls.append(ls[j]+ [strs[i]])`
`13`		`- return [x for x in ls if len(x)>0 ]`
`14`		`-`
`15`		`-# Testing the solution`
	`7`	`+ res = defaultdict(list)`
	`8`	`+ n = len(strs)`
	`9`	`+ for word in strs:`
	`10`	`+ res[str(sorted(word))].append(word)`
	`11`	`+ ress = list(res.values())`
	`12`	`+ return ress`
	`13`	`+`
	`14`	`+`
`16`	`15`
`17`	`16`
`18`	`17`
`19`	`18`
	`19`	`+strs = ["eat","tea","tan","ate","nat","bat"]`
`20`	`20`
`21`		`-strs= ["eat","tea","tan","ate","nat","bat"]`
	`21`	`+print(Solution().groupAnagrams(strs))`

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+class Solution:`
	`4`	`+ def topKFrequent(self, nums: List[int], k: int) -> List[int]:`
	`5`	`+`
	`6`	`+ res = set()`
	`7`	`+ for i in nums:`
	`8`	`+ if i <= k:`
	`9`	`+ if nums.count(i) > 1:`
	`10`	`+ res.add(i)`
	`11`	`+ if len(nums) == k:`
	`12`	`+ res.add(nums[i])`
	`13`	`+ return list(res)`
	`14`	`+`
	`15`	`+`
	`16`	`+`
	`17`	`+nums = [1,1,1,2,2,3,4,4]`
	`18`	`+k = 4`
	`19`	`+print(Solution().topKFrequent(nums,k))`

Lines changed: 1 addition & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,4 @@ def lengthOfLongestSubstring(self, s: str) -> int:`
`7`	`7`	`start = seen[letter] + 1`
`8`	`8`	`result = max(result, i - start + 1)`
`9`	`9`	`seen[letter] = i`
`10`		`- return result`
`11`		`-`
`12`		`-k = Solution()`
`13`		`-k.lengthOfLongestSubstring("abcabcbb")`
	`10`	`+ return result`

Comments

(0)