Commitca7dbc4

authored

Merge pull requestneetcode-gh#224 from qasimala/main

Added two additional methods - 217 Contains Duplicates

2 parents8ecb50d +45a6b65 commitca7dbc4Copy full SHA for ca7dbc4

File tree

+19

-2

lines changed

+19

-2

lines changed

Lines changed: 19 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,8 @@`
`2`	`2`	`*@param {number[]} nums`
`3`	`3`	`*@return {boolean}`
`4`	`4`	`*/`
	`5`	`+`
	`6`	`+//First method using Map() (exit early if true)`
`5`	`7`	`varcontainsDuplicate=function(nums){`
`6`	`8`	`constnumsSet=newSet()`
`7`	`9`	`for(constiofnums){`
`@@ -10,5 +12,20 @@ var containsDuplicate = function(nums) {`
`10`	`12`	`}`
`11`	`13`	`numsSet.add(i)`
`12`	`14`	`}`
`13`		`-returnfalse`
`14`		`-};`
	`15`	`+returnfalse;`
	`16`	`+};`
	`17`	`+`
	`18`	`+//Second method using Map() (Has to map entire array but code is more readable)`
	`19`	`+varcontainsDuplicate=function(nums){`
	`20`	`+//create a new hashmap with all the items in the array. Any duplicates will be removed.`
	`21`	`+consttotalWithoutDuplicates=newMap(nums.map((i)=>[i]));`
	`22`	`+`
	`23`	`+//check if the size of the initial array is larger than the new hashmap.`
	`24`	`+returntotalWithoutDuplicates.size!==nums.length;`
	`25`	`+};`
	`26`	`+`
	`27`	`+//Third method using Set() (Fastest runtime at 91.95% and very readable code)`
	`28`	`+varcontainsDuplicate=function(nums){`
	`29`	`+//Pass the array into a Set() (which removes duplicates) and then compare its size to the original array.`
	`30`	`+returnnewSet(nums).size!==nums.length;`
	`31`	`+};`

Comments

(0)