Commit708f66a

committed

update: 239

1 parent2255e02 commit708f66aCopy full SHA for 708f66a

File tree

+42

-0

lines changed

+42

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -81,6 +81,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`81`	`81`	`\|217\|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)\|[JavaScript](./src/contains-duplicate/res.js)\|Easy\|`
`82`	`82`	`\|219\|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)\|[JavaScript](./src/contains-duplicate-ii/res.js)\|Easy\|`
`83`	`83`	`\|220\|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)\|[JavaScript](./src/contains-duplicate-iii/res.js)\|Medium\|`
	`84`	`+\|239\|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/)\|[JavaScript](./src/sliding-window-maximum/description/res.js)\|Hard\|`
`84`	`85`	`\|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\|`
`85`	`86`	`\|274\|[H-Index](https://leetcode.com/problems/h-index/)\|[JavaScript](./src/h-index/res.js)\|Medium\|`
`86`	`87`	`\|275\|[H-Index II](https://leetcode.com/problems/h-index-ii/)\|[JavaScript](./src/h-index-ii/res.js)\|Medium\|`

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+/**`
	`2`	`+ *@param {number[]} nums`
	`3`	`+ *@param {number} k`
	`4`	`+ *@return {number[]}`
	`5`	`+ */`
	`6`	`+varmaxSlidingWindow=function(nums,k){`
	`7`	`+constn=nums.length;`
	`8`	`+if(n*k===0)return[];`
	`9`	`+if(k===1)returnnums;`
	`10`	`+`
	`11`	`+letleft=nums.map(()=>0);`
	`12`	`+left[0]=nums[0];`
	`13`	`+letright=nums.map(()=>0);`
	`14`	`+right[0]=nums[n-1];`
	`15`	`+`
	`16`	`+for(leti=1;i<n;i++){`
	`17`	`+constelement=nums[i];`
	`18`	`+`
	`19`	`+// 从左到右`
	`20`	`+if(i%k===0){`
	`21`	`+left[i]=nums[i];`
	`22`	`+}else{`
	`23`	`+left[i]=Math.max(left[i-1],nums[i]);`
	`24`	`+}`
	`25`	`+`
	`26`	`+// 从右到左`
	`27`	`+letj=n-i-1;`
	`28`	`+if((j+1)%k===0){`
	`29`	`+right[j]=nums[j];`
	`30`	`+}else{`
	`31`	`+right[j]=Math.max(right[j+1],nums[j]);`
	`32`	`+}`
	`33`	`+}`
	`34`	`+`
	`35`	`+letoutput=[];`
	`36`	`+for(leti=0;i<n-k+1;i++){`
	`37`	`+output.push(Math.max(right[i],left[i+k-1]));`
	`38`	`+}`
	`39`	`+`
	`40`	`+returnoutput;`
	`41`	`+};`

Comments

(0)