Commit 8e276d3

committed

Update

1 parent ff9ea06 commit 8e276d3Copy full SHA for 8e276d3

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`from typing import List`
`2`	`2`
	`3`	`+# ---------------------- Solution 1 -----------------------`
	`4`	`+`
`3`	`5`	`# class Solution:`
`4`	`6`	`# def twoSum(self, nums: List[int], target: int) -> List[int]:`
`5`	`7`	`# n = len(nums)`
`@@ -10,6 +12,8 @@`
`10`	`12`	`# return [i, num2]`
`11`	`13`	`# # raise ValueError("No solution found")`
`12`	`14`
	`15`	`+# ---------------------- Solution 2 -----------------------`
	`16`	`+`
`13`	`17`
`14`	`18`	`class Solution:`
`15`	`19`	`def twoSum(self, nums: List[int], target: int) -> List[int]:`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+# ---------------------- Solution 1 -----------------------`
	`4`	`+`
	`5`	`+class Solution:`
	`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`
	`16`	`+`
	`17`	`+`
	`18`	`+`
	`19`	`+`
	`20`	`+`
	`21`	`+strs = ["eat","tea","tan","ate","nat","bat"]`

Comments

(0)