Commit232f21f

committed

update: 219

1 parent86a0400 commit232f21fCopy full SHA for 232f21f

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -67,6 +67,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`67`	`67`	`\|207\|[Course Schedule](https://leetcode.com/problems/course-schedule/)\|[JavaScript](./src/course-schedule/res.js)\|Medium\|`
`68`	`68`	`\|210\|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)\|[JavaScript](./src/course-schedule-ii/res.js)\|Medium\|`
`69`	`69`	`\|217\|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)\|[JavaScript](./src/contains-duplicate/res.js)\|Easy\|`
	`70`	`+\|219\|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)\|[JavaScript](./src/contains-duplicate-ii/res.js)\|Easy\|`
`70`	`71`	`\|240\|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)\|[JavaScript](./src/search-a-2d-matrix-ii/res.js)\|Medium\|`
`71`	`72`	`\|274\|[H-Index](https://leetcode.com/problems/h-index/)\|[JavaScript](./src/h-index/res.js)\|Medium\|`
`72`	`73`	`\|275\|[H-Index II](https://leetcode.com/problems/h-index-ii/)\|[JavaScript](./src/h-index-ii/res.js)\|Medium\|`

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+/**`
	`2`	`+ *@param {number[]} nums`
	`3`	`+ *@param {number} k`
	`4`	`+ *@return {boolean}`
	`5`	`+ */`
	`6`	`+varcontainsNearbyDuplicate=function(nums,k){`
	`7`	`+constdupList=[];`
	`8`	`+if(k===0)returnfalse;`
	`9`	`+`
	`10`	`+for(letindex=0;index<nums.length;index++){`
	`11`	`+constelement=nums[index];`
	`12`	`+`
	`13`	`+if(dupList.includes(element)){`
	`14`	`+returntrue;`
	`15`	`+}elseif(dupList.length===k){`
	`16`	`+dupList.shift();`
	`17`	`+}`
	`18`	`+`
	`19`	`+dupList.push(element);`
	`20`	`+}`
	`21`	`+`
	`22`	`+returnfalse;`
	`23`	`+};`
	`24`	`+`
	`25`	`+/**`
	`26`	`+ *@param {number[]} nums`
	`27`	`+ *@param {number} k`
	`28`	`+ *@return {boolean}`
	`29`	`+ */`
	`30`	`+varcontainsNearbyDuplicate_2=function(nums,k){`
	`31`	`+constvisited={};`
	`32`	`+for(leti=0;i<nums.length;i++){`
	`33`	`+constnum=nums[i];`
	`34`	`+if(visited[num]!==undefined&&i-visited[num]<=k){`
	`35`	`+returntrue;`
	`36`	`+}`
	`37`	`+visited[num]=i;`
	`38`	`+}`
	`39`	`+returnfalse`
	`40`	`+};`

Comments

(0)