Commitf3a508f

authored

Merge pull requestneetcode-gh#3051 from BogdanBTS/main

Update 0189-rotate-array.js

2 parents32cb05f +17f85bb commitf3a508fCopy full SHA for f3a508f

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -24,3 +24,41 @@ var reversePortionOfArray = function(nums,start,end) {`
`24`	`24`	`end--;`
`25`	`25`	`}`
`26`	`26`	`}`
	`27`	`+`
	`28`	`+`
	`29`	`+/**`
	`30`	`+ * Two Pointers`
	`31`	`+ * https://leetcode.com/problems/rotate-array/`
	`32`	`+ *`
	`33`	`+ * Time O(n) \| Space O(1)`
	`34`	`+ *@param {number[]} nums`
	`35`	`+ *@param {number} k`
	`36`	`+ *@return {void} Do not return anything, modify nums in-place instead.`
	`37`	`+ */`
	`38`	`+varrotate=function(nums,k){`
	`39`	`+`
	`40`	`+k=k%nums.length;`
	`41`	`+`
	`42`	`+letl=0;`
	`43`	`+letr=nums.length-1;`
	`44`	`+`
	`45`	`+while(l<r){`
	`46`	`+[nums[l],nums[r]]=[nums[r],nums[l]];`
	`47`	`+l+=1;`
	`48`	`+r-=1;`
	`49`	`+}`
	`50`	`+l=0,`
	`51`	`+r=k-1;`
	`52`	`+while(l<r){`
	`53`	`+[nums[l],nums[r]]=[nums[r],nums[l]];`
	`54`	`+l+=1;`
	`55`	`+r-=1;`
	`56`	`+}`
	`57`	`+l=k;`
	`58`	`+r=nums.length-1;`
	`59`	`+while(l<r){`
	`60`	`+[nums[l],nums[r]]=[nums[r],nums[l]];`
	`61`	`+l+=1;`
	`62`	`+r-=1;`
	`63`	`+}`
	`64`	`+};`

Comments

(0)