Commitbec4e98

authored

Merge pull requestneetcode-gh#3189 from itsmohitnarayan/main

Created: 0350-Intersection-of-two-arrays-II.py

2 parentsac3f8e3 +a58f289 commitbec4e98Copy full SHA for bec4e98

File tree

+18

-1

lines changed

+18

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@ def dfs(r, c, i):`
`25`	`25`	`returnres`
`26`	`26`
`27`	`27`	`# To prevent TLE,reverse the word if frequency of the first letter is more than the last letter's`
`28`		`-count=defaultdict(int,sum(map(Counter,board),Counter()))`
	`28`	`+count=sum(map(Counter,board),Counter())`
`29`	`29`	`ifcount[word[0]]>count[word[-1]]:`
`30`	`30`	`word=word[::-1]`
`31`	`31`

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,17 @@`
	`1`	`+classSolution:`
	`2`	`+defintersect(self,nums1:List[int],nums2:List[int])->List[int]:`
	`3`	`+counter1=Counter(nums1)`
	`4`	`+counter2=Counter(nums2)`
	`5`	`+`
	`6`	`+# Using defaultdict to handle missing keys more efficiently`
	`7`	`+counter1=defaultdict(int,counter1)`
	`8`	`+counter2=defaultdict(int,counter2)`
	`9`	`+`
	`10`	`+intersection= []`
	`11`	`+`
	`12`	`+fornum,freqincounter1.items():`
	`13`	`+min_freq=min(freq,counter2[num])`
	`14`	`+ifmin_freq>0:`
	`15`	`+intersection.extend([num]*min_freq)`
	`16`	`+`
	`17`	`+returnintersection`

Comments

(0)